Meta-programming with typed object-language representations

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

Volumn 3286, Issue , 2004, Pages 136-167

  Pašalić, Emir ^a   Linger, Nathan ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

CASE-STUDIES; DE-BRUIJN INDICES; DOMAIN SPECIFIC; META LANGUAGE; META PROGRAMMING; SCOPING; TYPE EQUALITY; TYPING RULES;

COMPUTATIONAL LINGUISTICS;

EID: 32144459571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30175-2_8     Document Type: Article

References (37)

1. Cheney, J., Hinze, R.: First class phantom types. Technical Report CUCIS TR2003-1901, Cornell University, http://techreports.library.cornell.edu:8081/ Dienst/UI/1.0/Display/cul.cis/ TR2003-1901 (2003)
2. Sheard, T., Benaissa, Z., Pašalić, E.: DSL implementation using staging and monads. In: Second Conference on Domain-Specific Languages (DSL'99), Austin, Texas, USEUNIX (1999)
3. Taha, W., Makholm, H., Hughes, J.: Tag elimination and jones-optimality. Lecture Notes in Computer Science 2053 (2001) 257-??
4. Pašalić, E., Taha, W., Sheard, T.: Tagless staged interpreters for typed languages. In: The International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, ACM (2002)
5. Bruijn, N.G.d.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagaciones Mathematische 34 (1972) 381-392
6. This also appeared in the Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, series A, 75, No. 5.
7. Baars, A.I., Swierstra, S.D.: Typing dynamic typing. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), Pittsburgh, Pennsylvania, USA, October 4-6, 2002. SIGPLAN Notices 37(9), ACM Press (2002)
8. Cheney, J., Hinze, R.: Phantom types. Available from http://www. informatik.uni-bonn.de/~ralf/publications/Phantom.pdf. (2003)
9. Weirich, S.: Type-safe cast: functional pearl. In: Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP-00). Volume 35.9 of ACM Sigplan Notices., N.Y., ACM Press (2000) 58-67
10. Nordström, B., Peterson, K., Smith, J.M.: Programming in Martin-Lof's Type Theory. Volume 7 of International Series of Monographs on Computer Science. Oxford University Press, New York, NY (1990) Currently available online from first authors homepage.
11. Sheard, T., Pasalic, E., Linger, R.N.: The wmega implementation. Available on request from the author. (2003)
12. Jones, M.P.: Qualified Types: Theory and Practice. PhD thesis, Oxford University (1992)
13. Also available as Programming Research Group technical report 106.
14. Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. Journal of the ACM 27 (1980) 356-364
15. Xi, H., Pfenning, F.: Dependent types in practical programming. In: Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, New York, NY, ACM (1999) 214-227
16. Taha, W., Sheard, T.: MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science 248 (2000)
17. Taha, W., Calcagno, C., Huang, L., Leroy, X.: MetaOCaml: A compiled, type-safe multi-stage programming language. Available from http://cs-www.cs. yale.edu/homes/taha/MetaOCaml/ (2001)
18. Sheard, T., Jones, S.P.: Template meta-programming for Haskell. ACM SIGPLAN Notices 37 (2002) 60-75
19. Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall (1993) Avaiable online from http://www.dina.dk/~sestoft.
20. Taha, W., Makholm, H., Hughes, J.: Tag elimination and Jones-optimality. In Danvy, O., Filinski, A., eds.: Programs as Data Objects. Volume 2053 of Lecture Notes in Computer Science. (2001) 257-275
21. Huang, L., Taha, W.: A practical implementation of tag elimination. In preperation (2002)
22. Sheard, T., Linger, N.: Search-based binding time analysis using type-directed pruning. In: Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM), ACM Press (2002) 20-31
23. Linger, N., Sheard, T.: Binding-time analysis for metaml via type inference and constraint solving. Proceedings of TACAS '04 (2004)
24. Cheney, J., Hinze, R.: A lightweight implementation of generics and dynamics. In: Proc. of the workshop on Haskell, ACM_Press (2002) 90-104
25. Leijen, D., Meijer, E.: Domain-specific embedded compilers. In: Proceedings of the 2nd Conference on Domain-Specific Languages, Berkeley, CA, USENIX Association (1999) 109-122
26. Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In Norris, C., Fenwick, J.J.B., eds.: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL-03). Volume 38, 1 of ACM SIGPLAN Notices., New York, ACM Press (2003) 224-235
27. Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. In: Proceedings Symposium on Logic in Computer Science, Washington, IEEE Computer Society Press (1987) 194-204 The conference was held at Cornell University, Ithaca, New York.
28. Pfenning, F., Schürmann, C.: System description: Twelf - A meta-logical framework for deductive systems. In Ganzinger, H., ed.: Proceedings of the 16th International Conference on Automated Deduction (CADE-16). Volume 1632 of LNAL, Berlin, Springer-Verlag (1999) 202-206
29. Barras, B., Boutin, S., Comes, C., Courant, J., Filliatre, J., Giménez, E., Herbelin, H., Huet, G., Muñoz, C., Murthy, C., Parent, G., Paulin, C., Saibi, A., Werner, B.: The Coq Proof Assistant Reference Manual - Version V6.1. Technical Report 0203, INRIA (1997)
30. Augustsson, L., Carlsson, M.: An exercise in dependent types: A well-typed interpreter. In: Workshop on Dependent Types in Programming, Gothenburg (1999) Available online from www.cs.chalmers.se/~augustss/cayenne/ interp.ps.
31. Chen, C., Xi, H.: Meta-Programming through Typeful Code Representation. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, Uppsala, Sweden (2003) 275-286
32. Hudak, P.: Building domain-specific embedded languages. ACM Computing Surveys 28 (1996) 196
33. Elliott, C., Finne, S., de Moor, O.: Compiling embedded languages. Journal of Functional Programming 8 (1998) 543-572
34. Rhiger, M.: A foundation for embedded languages. ACM Transactions on Programming Languages and Systems TOPLAS 25 (2003) 291-315
35. Benaissa, Z.E.A., Briaud, D., Lescanne, P., Rouyer-Degli, J.: λv, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming 6 (1996) 699-722
36. Jones, M.P.: The hugs 98 user manual (200)
37. Calcagno, C., Taha, W., Huang, L., Leroy, X.: Implementing multi-stage languages using ASTs, gensym, and reflection. In Czarnecki, K., Pfenning, F., Smaragdakis, Y., eds.: Generative Programming and Component Engineering (GPCE). Lecture Notes in Computer Science, Springer-Verlag (2003)