Implementing typeful program transformations
- 7 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 38 (10) , 20-28
- https://doi.org/10.1145/777388.777392
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Tagless staged interpreters for typed languagesPublished by Association for Computing Machinery (ACM) ,2002
- Typing dynamic typingPublished by Association for Computing Machinery (ACM) ,2002
- Meta-programming with names and necessityPublished by Association for Computing Machinery (ACM) ,2002
- From system F to typed assembly languageACM Transactions on Programming Languages and Systems, 1999
- Cayenne—a language with dependent typesPublished by Association for Computing Machinery (ACM) ,1998
- TILPublished by Association for Computing Machinery (ACM) ,1996
- A framework for defining logicsJournal of the ACM, 1993
- Explicit substitutionsJournal of Functional Programming, 1991
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972