Haskell, do you read me?Constructing and composing efficient top-down parsers at runtime

Haskell'08 - Proceedings of the ACM SIGPLAN 2008 Haskell Symposium

Volumn , Issue , 2008, Pages 63-74

  Viera, Marcos ^a   Swierstra, S Doaitse ^b   Lempsink, Eelco ^b  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

GADT; Haskell; Left corner transform; Meta programming; Parser combinators; Type systems; Typed abstract syntax; Typed transformations

Indexed keywords

ABSTRACTING; MATHEMATICAL OPERATORS;

GADT; HASKELL; LEFT-CORNER TRANSFORM; META PROGRAMMING; PARSER COMBINATORS; TYPE SYSTEMS; TYPED ABSTRACT SYNTAX; TYPED TRANSFORMATIONS;

SYNTACTICS;

EID: 63149112028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411286.1411296     Document Type: Conference Paper

References (15)

1. Arthur Baars and Doaitse Swierstra. Typed transformations of typed abstract syntax. UU-CS 21, Utrecht University, 2008.
2. Arthur Baars, Andres Löh, and Doaitse Swierstra. Parsing permutation phrases. J Funct. Program., 14(6):635-646, 2004. ISSN 0956-7968.
3. Arthur I. Baars and S. Doaitse Swierstra. Type-safe, self inspecting code. In Haskell '04: Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, pages 69-79, New York, NY, USA, 2004. ACM. ISBN 1-58113-850-4. doi: http://doi.acm.org/10.1145/1017472.1017485.
4. Eric Bouwers, Martin Bravenboer, and Eelco Visser. Grammar engineering support for precedence rule recovery and compatibility checking. Electron. Notes Theor. Comput. Sci., 203(2):85-101, 2008. ISSN 1571-0661.
5. Martin Bravenboer. Exercises in Free Syntax. Syntax Definition, Parsing, and Assimilation of Language Conglomerates. PhD thesis, Utrecht University, Utrecht, The Netherlands, January 2008.
6. M. Johnson. Finite-state approximation of constraint-based grammars using left-corner grammar transforms. In COLING-ACL Õ98, Montreal, Quebec, Canada, pages 619-623. Association for Computational Linguistics, 1998.
7. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. ACM SIGPLAN Notices, 38 (3):26-37, March 2003. Proceedings of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003).
8. Ralf Lämmel and Simon Peyton Jones. Scrap more boilerplate: reflection, zips, and generalised casts. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 2004), pages 244-255. ACM Press, 2004.
9. Conor McBride and Ross Paterson. Applicative programming with effects. Journal of Functional Programming, 18(01): 1-13, 2007. doi: 10.1017/S0956796807006326.
10. Emir Pasalic and Nathan Linger. Meta-programming with typed object-language representations. In Generative Programming and Component Engineering (GPCE'04), volume LNCS 3286, pages 136-167, October 2004.
11. JC Petruzza, Koen Claessen, and Simon Peyton Jones. Derived read instances for recursive datatypes with infix constructors are too inefficient. URL http://hackage.haskell.org/trac/ghc/ticket/1544. GHC Ticket 1544.
12. Simon Peyton Jones. Haskell 98 Language and Libraries: the Revised Report. 2003.
13. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Simple nification-based type inference for gadts. SIGPLANNot., 41(9):50-61, 2006. ISSN 0362-1340.
14. Tim Sheard and Simon Peyton Jones. Template meta-programming for haskell. In Proceedings of the ACM SIGPLAN workshop on Haskell, pages 1-16. ACM Press, 2002. ISBN 1-58113-605-6.
15. S.D. Swierstra. The Utrecht Parsing Libraries. http://www.cs.uu.nl/wiki/ bin/view/HUT/ParserCombinators, July 2008.