activity
20152019
most citedCapivara: A decentralized package version control using Blockchain

2 citations · 5 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CR2019★ 2 cited

Capivara: A decentralized package version control using Blockchain

Felipe Zimmerle da N. Costa, Ruy J. Guerra B. de Queiroz

Distributed consensus and Blockchains are popular among the cryptocurrencies where no one except the coins users, owns the data and transactions. No different to open source reposi…

cs.LO2019

The -groupoid generated by an arbitrary topological -model

Daniel O. Martínez-Rivillas, Ruy J. G. B. de Queiroz

The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules.…

cs.LO2018★ 1 cited

On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths

Tiago Mendonça Lucena de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz +1

One of the most interesting entities of homotopy type theory is the identity type. It gives rise to an interesting interpretation of the equality, since one can semantically interp…

cs.LO2018

On the Use of Computational Paths in Path Spaces of Homotopy Type Theory

Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina G. de Oliveira +1

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms of a type …

cs.LO2018

Sequentialization for full N-Graphs via sub-N-Graphs

Ruan V. B. Carvalho, Lais S. Andrade, Anjolina G. de Oliveira +1

Since proof-nets for MLL- were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof b…

cs.FL2015★ 1 cited

Formalization of the pumping lemma for context-free languages

Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira +1

Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid fo…