Towards Typed Semantics for Parsing Expression Grammars-Reference-Cited by-同舟云学术

Towards Typed Semantics for Parsing Expression Grammars

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the XXIII Brazilian Symposium on Programming Languages - SBLP 2019
language:
Short-container-title:

Author:

Ribeiro Rodrigo¹,Reis Leonardo V. S.²,Feitosa Samuel³,Cardoso Elton M.⁴

Affiliation:

1. Universidade Federal de Ouro Preto, Ouro Preto, Minas Gerais --- Brazil

2. Universidade Federal de Juiz de Fora, Juiz de Fora, Minas Gerais --- Brazil

3. Universidade Federal de Pelotas, Pelotas, Rio Grande do Sul --- Brazil

4. Universidade Federal de Ouro Preto, João Monlevade, Minas Gerais --- Brazil

Publisher

ACM Press

Reference22 articles.

1. Nick Benton, Chung-Kil Hur, Andrew J. Kennedy, and Conor Mcbride. 2012. Strongly Typed Term Representations in Coq. J. Autom. Reason. 49, 2 (Aug. 2012), 141--159. https://doi.org/10.1007/s10817-011-9219-0

2. Jean-Philippe Bernardy and Patrik Jansson. 2016. Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda. CoRR abs/1601.07724 (2016). http://arxiv.org/abs/1601.07724

3. Janusz A. Brzozowski. 1964. Derivatives of Regular Expressions. J. ACM 11, 4 (Oct. 1964), 481--494. https://doi.org/10.1145/321239.321249

4. N.G de Bruijn. 1972. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae (Proceedings) 75, 5 (1972), 381 -- 392. https://doi.org/10.1016/1385-7258(72)90034-0

5. Denis Firsov and Tarmo Uustalu. 2013. Certified Parsing of Regular Languages. In Certified Programs and Proofs - Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13, 2013, Proceedings (Lecture Notes in Computer Science), Georges Gonthier and Michael Norrish (Eds.), Vol. 8307. Springer, 98--113. https://doi.org/10.1007/978-3-319-03545-1_7

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Type-based Termination Analysis for Parsing Expression Grammars;Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing;2023-03-27

2. A Type-Directed Algorithm to Generate Random Well-Formed Parsing Expression Grammars;XXVI Brazilian Symposium on Programming Languages;2022-10-06