Typed self-representation

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2009, Pages 293-303

  Rendel, Tillmann ^a   Ostermann, Klaus ^a   Hofer, Christian ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Lambda calculus; Language design; Reflection; Self interpretation; Types

Indexed keywords

BASE LANGUAGE; HIGHER ORDER; LAMBDA CALCULUS; LANGUAGE DESIGN; META PROGRAMMING; POLYMORPHIC LAMBDA CALCULUS; PROGRAMMING LANGUAGE DESIGN; SUBLANGUAGES;

ADA (PROGRAMMING LANGUAGE); C (PROGRAMMING LANGUAGE); CALCULATIONS; COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE; DESIGN; DIFFERENTIATION (CALCULUS); LINGUISTICS; PROGRAM INTERPRETERS;

QUERY LANGUAGES;

EID: 70450253199     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542509     Document Type: Conference Paper

References (30)

1. T. Altenkirch and C. McBride. Generic programming within dependently typed programming. In Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming, pages 1-20. Kluwer, B.V., 2003.
2. B. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, and S. Weirich. Engineering formal metatheory. In POPL '08, pages 3-15, New York, NY, USA, 2008. ACM.
3. H. P. Barendregt. Lambda calculi with types. In Handbook of logic in computer science (vol. 2): background: computational structures, pages 117-309. Oxford University Press, 1992.
4. S. Berardi. Towards a mathematical analysis of the Coquand-Huet calculus of constructions and the other systems in Baren-dregt's cube. Technical report, Department of Computer Science, Carnegie-Mellon University and Dipartimento Matematica, Universita di Torino, 1988.
5. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions. Springer-Verlag, 2004.
6. C. Böhm and A. Berarducci. Automatic synthesis of typed lambda-programs on term algebras. Theor. Comput. Sci., 39:135-154, 1985.
7. J. Carette, O. Kiselyov, and C. Shan. Finally tagless, partially evaluated. In APLAS'07, extended version to appear in Journal of Functional Programming, pages 222-238. Springer LNCS 4807, 2007.
8. T. Coquand. An analysis of Girard's paradox. In In Symposium on Logic in Computer Science, pages 227-236. IEEE Computer Society Press, 1986.
9. R. Davies and F. Pfenning. A modal analysis of staged computation. J. ACM, 48(3):555-604, 2001.
10. N. G. de Bruijn. Lambda calculus notation with nameless dummies. a tool for automatic formula manipulation with application to the church-rosser theorem. Indagationes Mathe-maticae, 34:381-392, 1972.
11. L. Fegaras and T. Sheard. Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). In POPL '96, pages 284-294. ACM, 1996.
12. J. Y. Girard. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. Thése de doctorat detat, Université de Paris VII, 1972.
13. M. Hagiya. Meta-circular interpreter for a strongly typed language. J. Symb. Comput., 8(6):651-680, 1989.
14. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In POPL '95, pages 130-141. ACM, 1995.
15. R. Hinze, J. Jeuring, and A. Löh. Type-indexed data types. Sci. Comput. Program., 51(1-2):117-151, 2004.
16. C. Hofer, K. Ostermann, T. Rendel, and A. Moors. Polymorphic embedding of DSLs. In GPCE'08. ACM, 2008.
17. K. Läufer and M. Odersky. Self-interpretation and reflection in a statically typed language. In Proc. OOPSLA Workshop on Reflection and Metalevel Architectures. ACM, Oct. 1993.
18. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part i. Commun. ACM, 3(4):184-195, 1960.
19. A. Nanevski. Meta-programming with names and necessity. In ICFP, pages 206-217, 2002.
20. F. Pfenning and C. Elliot. Higher-order abstract syntax. In PLDI '88, pages 199-208. ACM, 1988.
21. F. Pfenning and P. Lee. Metacircularity in the polymorphic λ-calculus. Theoretical Computer Science, 89(1):137-159, 1991.
22. F. Pfenning and C. Paulin-Mohring. Inductively defined types in the calculus of constructions. In Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics, pages 209-228. Springer-Verlag, 1990.
23. M. B. Reinhold. Typechecking is undecidable when "type" is a type. Technical report, Massachusetts Institute of Technology, 1989.
24. J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM '72: Proceedings of the ACM annual conference, pages 717-740. ACM, 1972.
25. J. M. Siskind and B. A. Pearlmutter. First-class nonstandard interpretations by opening closures. In POPL '07, pages 71-76. ACM, 2007.
26. B. C. Smith. Reflection and semantics in LISP. In POPL '84, pages 23-35. ACM, 1984.
27. G. L. Steele. Growing a language. Higher-Order and Symbolic Computation, 12(3):221-236, 1999.
28. W. Taha, Z. Benaissa, and T. Sheard. Multi-stage programming: Axiomatization and type-safety. In In 25th International Colloquium on Automata, Languages, and Programming, pages 918-929. Springer-Verlag, 1998.
29. J. Terlouw. Een nadere bewijstheoretische analyse van GSTT's. Technical report, Department of Computer Science, Catholic University, Nijmegen, The Netherlands, 1989.
30. *. J. Funct. Program., 18(1):87-140, 2008.