Type-safe, self inspecting code

Proceedings of the ACM SIGPLAN 2004 Haskell Workshop, Haskell'04

Volumn , Issue , 2004, Pages 69-79

  Baars, Arthur I ^a   Swierstra, S Doaitse ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Compilers; Domain specific languages; Left recursion; Top down parsing

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; PROGRAM COMPILERS; SYNTACTICS; TREES (MATHEMATICS);

DOMAIN SPECIFIC LANGUAGES; LEFT-RECURSION; TOP-DOWN PARSING;

CODES (SYMBOLS);

EID: 11244292429     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1017472.1017485     Document Type: Conference Paper

References (31)

1. Glasgow haskell compiler. Available from: http://www.haskell.org/ghc/.
2. Happy, the parser generator for haskell. Available from: http://www.haskell.org/happy/.
3. A. Baars and D. Swierstra. Syntax macros, http://www.cs. uu.nl/groups/ST/Center/SyntaxMacros.
4. A. I. Baars and S. D. Swierstra. Typing dynamic typing. In Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 157-166. ACM Press, 2002.
5. L. Cardelli, F. Matthes, and M. Abadi. Extensible syntax with lexical scoping. Technical Report 121, Digital Systems Research Center, 1994.
6. J. Cheney and R. Hinze. First-Class Phantom Types. Technical report TR2003-1901, Cornell University, 2003. http://techreports.library.cornell.edu: 8081/Dienst/UI/1.0/Display/cul.c%is/TR2003-1901.
7. O. Chitil. Pretty printing with lazy dequeues. accepted for Transaction on Programming Languages and Systems, 2004.
8. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. ACM SIG-PLAN Notices, 35(9):268-279, Sept. 2000.
9. K. Claessen and D. Sands. Observable sharing for functional circuit description. In Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science, pages 62-73. Springer-Verlag, 1999.
10. L. Erkök and J. Launchbury. A recursive do for haskell. In Proceedings of the ACM SIGPLAN workshop on Haskell, pages 29-37. ACM Press, 2002.
11. J. Fokker. Functional parsers. In J. Jeuring and H. Meijer, editors, Advanced Functional Programming, number 925 in LNCS, pages 1-52, 1995.
12. J. Hughes. The Design of a Pretty-printing Library. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925. Springer Verlag, 1995.
13. J. Hughes. Generalising monads to arrows. Science of Computer Programming, 37(1-3):67-111, 2000.
14. J. Hughes and D. Swierstra. Polish parsers, step by step. In International Conference on Functional Programming, volume 8, pages 239-248, Uppsala, Sweden, August 2003. ACM Sigplan.
15. G. Hutton and H. Meijer. Monadic parser combinators. Journal of Functional Programming, 8(4):437-444, 1998.
16. B. Leavenworth. Syntax macros and extended translation. CACM, 9(11):790-793, November 1966.
17. D. Leijen. Parsec, a fast combinator parser, http://www.cs.uu.nl/~daan/ parsec.html, Nov. 2001.
18. D. Leijen and E. Meijer. Domain specific embedded compilers. In 2nd USENIX Conference on Domain Specific Languages (DSL'99), pages 109-122, Austin, Texas, Oct. 1999.
19. Also appeared in ACM SIGPLAN Notices 35, 1, (Jan. 2000).
20. E. Pasalic and N. Linger. Meta-programming with typed object-language representations. In accepted to: GPCE'04, 2004.
21. R. Paterson. A new notation for arrows. In International Conference on Functional Programming, pages 229-240. ACM Press, Sept. 2001.
22. S. Peyton Jones. Haskell 98 Language and Libraries. Cambridge University Press, April 2003. http://www.haskell. org/report.
23. S. L. Peyton Jones. Haskell pretty-printing library. http://www.haskell. org/libraries/#prettyprinting.
24. T. Sheard and S. P. Jones. Template meta-programming for haskell. In Proceedings of the ACM SIGPLAN workshop on Haskell, pages 1-16. ACM Press, 2002.
25. D. Swierstra and L. Duponcheel. Deterministic, error correct ing combinator parsers. In Advanced Functional Programming, Second International Spring School, volume 1129 of LNCS, pages 184-207. Springer-Verlag, 1996.
26. S. D. Swierstra. Combinator parsers: From toys to tools. In G. Hutton, editor, Electronic Notes in Theoretical Computer Science, volume 41. Elsevier Science Publishers, 2001.
27. S. D. Swierstra, P. Azero Alocer, and J. Saraiava. Designing and implementing combinator languages. In S. D. Swierstra, P. Henriques, and J. Oliveira, editors, Advanced Functional Programming, Third International School, AFP'98, volume 1608 of LNCS, pages 150-206. Springer-Verlag, 1999.
28. P. Thiemann. WASH/CGI: Server-side web scripting with sessions and typed, compositional forms. In Practical Aspects of Declarative Languages, pages 192-208, 2002.
29. P. Wadler. How to replace failure with a list of successes. In Functional Programming Languages and Computer Architecture, volume 201 of LNCS, pages 113-128. Springer-Verlag, 1985.
30. P. Wadler. Theorems for free. In M. Queen, editor, 4'th International Conference on Functional Programming and Computer Architecture, pages 347-359, London, Sept. 1989. Addison-Wesley.
31. P. Wadler. A prettier printer. In J. Gibbons and O. d. Moor, editors, The fun of programming, pages 223-244. Palgrave Macmillan, 2003.