%0 Conference Paper
%B Logic, Language, Information, and Computation – 23rd International Workshop, WoLLIC 2016
%D 2016
%T On the Formalization of Some Results of Context-Free Language Theory
%A Marcus Vinícius Midena Ramos
%A Ruy J. G. B. de Queiroz
%A Nelma Moreira
%A José Bacelar Almeida
%E Jouko Väänänen
%E Åsa Hirvonen
%E Ruy de Queiroz
%I Springer-Verlag
%S Lecture Notes in Computer Science
%U http://www.springer.com/us/book/9783662529201
%V 9803
%X <p>This work describes a formalization effort, using the Coq proof assistant, of fundamental results related to the classical theory of context-free grammars and languages. These include closure properties (union, concatenation and Kleene star), grammar simplification (elimi- nation of useless symbols, inaccessible symbols, empty rules and unit rules), the existence of a Chomsky Normal Form for context-free grammars and the Pumping Lemma for context-free languages. The result is an important set of libraries covering the main results of context-free language theory, with more than 500 lemmas and theorems fully proved and checked. This is probably the most comprehensive formalization of the classical context-free language theory in the Coq proof assistant done to the present date, and includes the important result that is the formalization of the Pumping Lemma for context-free languages.</p>
%Z <p>n/a</p>
%> https://haslab.uminho.pt/sites/default/files/jba/files/16wollic.pdf