Programming Type-Safe Transformations Using Higher-Order Abstract Syntax
No abstract available.
DOI 10.1007/978-3-319-03545-1_16
Related papers
- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs ESOP 2016
- A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions POPL 2008
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages JFP 2009
- Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism JFP 2008
- Using circular programs for higher-order syntax: functional pearl ICFP 2013
- Type-safe, self inspecting code Haskell 2004
- Normalization by evaluation with typed abstract syntax JFP 2001
- Parametric higher-order abstract syntax for mechanized semantics ICFP 2008