Dependently typed grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6120 LNCS, Issue , 2010, Pages 58-79

  Brink, Kasper ^a   Holdermans, Stefan ^b   Löh, Andres ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Vector Fabrics   (Netherlands)

Author keywords

Context free grammars; Dependently typed programming; Grammar transformation

Indexed keywords

ABSTRACT REPRESENTATION; COMBINATORS; DEPENDENT TYPES; DEPENDENTLY TYPED PROGRAMMING; FUNCTIONAL PROGRAMMING LANGUAGES; GRAMMAR TRANSFORMATION; LEFT-RECURSION; PARSER COMBINATORS; TYPE SYSTEMS;

BEHAVIORAL RESEARCH; FUNCTIONAL PROGRAMMING; MODEL PREDICTIVE CONTROL; SEMANTICS;

CONTEXT FREE LANGUAGES;

EID: 78249288288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13321-3_6     Document Type: Conference Paper

References (17)

1. Hutton, G.: Higher-order functions for parsing. Journal of Functional Programming 2, 323-343 (1992)
2. Swierstra, S.D., Duponcheel, L.: Deterministic, error-correcting combinatory parsers. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol. 1129, pp. 184-207. Springer, Heidelberg (1996)
3. Swierstra, S.D.: Combinator parsing: A short tutorial. In: Bove, A., Barbosa, L.S., Pardo, A., Pinto, J.S. (eds.) ALFA. LNCS, vol. 5520, pp. 252-300. Springer, Heidelberg (2009)
4. Leijen, D., Meijer, E.: Parsec: Direct style monadic parser combinator for the real world. Technical Report UU-CS-2001-035, Utrecht University (2001)
5. Norell, U.: Dependently typed programming in Agda. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol. 5832, pp. 230-266. Springer, Heidelberg (2009)
6. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)
7. Brink, K., Holdermans, S., Löh, A.: Dependently typed grammars, Agda code (2010), http://www.cs.uu.nl/~andres/DTG/
8. Fokker, J.: Functional parsers. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 1-23. Springer, Heidelberg (1995)
9. Rosenkrantz, D.J., Lewis, P.M.: Deterministic left corner parsing. In: Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pp. 139-152. IEEE, Los Alamitos (1970)
10. Johnson, M.: Finite-state approximation of constraint-based grammars using leftcorner grammar transforms. In: COLING-ACL, pp. 619-623 (1998)
11. Baars, A.I., Swierstra, S.D., Viera, M.: Typed transformations of typed grammars: The left corner transform. To appear in the proceedings of the 9th Workshop on Language Descriptions, Tools and Applications (LDTA 2009), York, England (March 29, 2009)
12. Hughes, J.: Generalising monads to arrows. Science of Computer Programming 37, 67-111 (2000)
13. Pasàlić, E., Linger, N.: Meta-programming with typed object-language representations. In: Karsai, G., Visser, E. (eds.) GPCE 2004. LNCS, vol. 3286, pp. 136-167. Springer, Heidelberg (2004) (Pubitemid 39745353)
14. Baars, A.I., Swierstra, S.D., Viera, M.: Typed transformations of typed abstract syntax. In: Kennedy, A., Ahmed, A. (eds.) Proceedings of TLDI'09: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Savannah, GA, USA, January 24, pp. 15-26. ACM Press, New York (2009)
15. Danielsson, N.A., Norell, U.: Structurally recursive descent parsing (2008), http://www.cs.nott.ac.uk/~nad/publications/danielsson-norell- parserparser-combinators.html
16. Danielsson, N.A.: Total parser combinators (2009), http://www.cs.nott.ac. uk/~nad/publications/danielsson-parser-combinators.html
17. Delahaye, D.: A tactic language for the system Coq. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 85-95. Springer, Heidelberg (2000)