2 citations · 5 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Formalization of closure properties for context-free grammars
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz
Context-free language theory is a well-established area of mathematics, relevant to computer science foundations and technology. This paper presents the preliminary results of an o…
Context-Free Language Theory Formalization
Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz
Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program…
On the Identity Type as the Type of Computational Paths
Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina G. de Oliveira
We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. O…