Syntax for Free: Representing Syntax with Binding Using Parametricity
- 1 January 2009
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Engineering formal metatheoryPublished by Association for Computing Machinery (ACM) ,2008
- Finally Tagless, Partially EvaluatedPublished by Springer Science and Business Media LLC ,2007
- Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*Journal of Functional Programming, 2007
- Mechanizing metatheory in a logical frameworkJournal of Functional Programming, 2007
- A foundation for embedded languagesACM Transactions on Programming Languages and Systems, 2003
- Monadic encapsulation of effects: a revised approach (extended version)Journal of Functional Programming, 2001
- Higher-order abstract syntax in CoqLecture Notes in Computer Science, 1995
- Metacircularity in the polymorphic λ-calculusTheoretical Computer Science, 1991
- Constructions: A higher order proof system for mechanizing mathematicsLecture Notes in Computer Science, 1985
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972