Abstract
We characterize the data type of terms with bindings, freshness and substitution, as an initial model in a suitable Horn theory. This characterization yields a convenient recursive definition principle, which we have formalized in Isabelle/HOL and employed in a series of case studies taken from the λ-calculus literature.
Supplemental Material
- Bedwyr. http://slimmer.gforge.inria.fr/bedwyr.Google Scholar
- Beluga. http://www.cs.mcgill.ca/~complogic/beluga.Google Scholar
- Delphin. http://cs-www.cs.yale.edu/homes/carsten/delphin.Google Scholar
- http://www4.in.tum.de/~popescua/Scripts.zip.Google Scholar
- The Twelf Project, 2009. http://twelf.plparty.org.Google Scholar
- The HOL4 Theorem prover, 2010. http://hol.sourceforge.net/.Google Scholar
- S. J. Ambler, Roy L. Crole, and Alberto Momigliano. A definitional approach to primitive recursion over Higher Order Abstract Syntax. In MERLIN, 2003. Google Scholar
Digital Library
- Simon Ambler, Roy L. Crole, and Alberto Momigliano. Combining Higher Order Abstract Syntax with tactical theorem proving and (co)induction. In TPHOLs, pages 13--30, 2002. Google Scholar
Digital Library
- Brian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, and Stephanie Weirich. Engineering formal metatheory. In POPL, pages 3--15, 2008. Google Scholar
Digital Library
- Jacques Carette, Oleg Kiselyov, and Chung chieh Shan. Finally tagless, partially evaluated. In APLAS, pages 222--238, 2007. Google Scholar
Digital Library
- Adam J. Chlipala. Parametric higher-order abstract syntax for mechanized semantics. In ICFP, pages 143--156, 2008. Google Scholar
Digital Library
- Pierre-Louis Curien. Categorical combinators. Information and Control, 69 (1--3): 188--254, 1986. Google Scholar
Digital Library
- N. de Bruijn. λ-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math, 34 (5): 381--392, 1972.Google Scholar
Cross Ref
- Joëlle Despeyroux, Amy P. Felty, and André Hirschowitz. Higher-order abstract syntax in Coq. In TLCA, pages 124--138, 1995. Google Scholar
Digital Library
- Amy P. Felty and Alberto Momigliano. Hybrid: A definitional two-level approach to reasoning with Higher-Order Abstract Syntax. CoRR, abs/0811.4367, 2008.Google Scholar
- Marcelo Fiore, Gordon Plotkin, and Daniele Turi. Abstract syntax and variable binding (extended abstract). In LICS, pages 193--202, 1999. Google Scholar
Digital Library
- M. J. Gabbay. A theory of inductive definitions with α-equivalence. Ph.D. thesis. University of Cambridge, 2001.Google Scholar
- Andrew D. Gordon. A mechanisation of name-carrying syntax up to alpha-conversion. In HUG, pages 413--425, 1994. ISBN 3-540-57826-9. Google Scholar
Digital Library
- Andrew D. Gordon and Thomas F. Melham. Five axioms of alpha-conversion. In TPHOLs, pages 173--190, 1996. Google Scholar
Digital Library
- Elsa L. Gunter, Christopher J. Osborn, and Andrei Popescu. Theory support for weak Higher Order Abstract Syntax in Isabelle/HOL. In LFMTP, pages 12--20, 2009. Google Scholar
Digital Library
- Robert Harper and Daniel R. Licata. Mechanizing metatheory in a logical framework. J. Funct. Program., 17 (4--5): 613--673, 2007. Google Scholar
Digital Library
- Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. In LICS, pages 194--204. IEEE, Computer Society Press, 1987.Google Scholar
- Martin Hofmann. Semantical analysis of higher-order abstract syntax. In LICS, page 204, 1999. Google Scholar
Digital Library
- Alberto Momigliano and Simon Ambler. Multi-level meta-reasoning with higher-order abstract syntax. In FoSSaCS, pages 375--391, 2003. Google Scholar
Digital Library
- Alberto Momigliano, Alan J. Martin, and Amy P. Felty. Two-level Hybrid: A system for reasoning using Higher-Order Abstract Syntax. Electron. Notes Theor. Comput. Sci., 196: 85--93, 2008. Google Scholar
Digital Library
- Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL: A Proof Assistant for Higher-order Logic. Springer, 2002. Google Scholar
Digital Library
- Michael Norrish. Recursive function definition for types with binders. In TPHOLs, pages 241--256, 2004.Google Scholar
Cross Ref
- Michael Norrish. Mechanising lambda-calculus using a classical first order theory of terms with permutations. Higher-Order and Symbolic Computation, 19 (2-3): 169--195, 2006. Google Scholar
Digital Library
- Michael Norrish and René Vestergaard. Proof pearl: De Bruijn terms really do work. In TPHOLs, pages 207--222, 2007. Google Scholar
Digital Library
- L. C. Paulson. The foundation of a generic theorem prover. J. Autom. Reason., 5 (3), 1989. Google Scholar
Digital Library
- F. Pfenning and C. Elliot. Higher-order abstract syntax. In PLDI, pages 199--208, 1988. Google Scholar
Digital Library
- Andrew M. Pitts. Nominal logic: A first order theory of names and binding. In TACS, pages 219--242, 2001. Google Scholar
Digital Library
- Andrew M. Pitts. Alpha-structural recursion and induction. J. ACM, 53 (3), 2006. Google Scholar
Digital Library
- Gordon D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci., 1 (2): 125--159, 1975.Google Scholar
Cross Ref
- Robert Pollack and Masahiko Sato. A canonical locally named representation of binding. To appear in Journal of Automated Reasoning. Google Scholar
Digital Library
- Andrei Popescu. Contributions to the theory of syntax with bindings and to process algebra. Ph.D. Thesis, Univ. of Illinois, 2010. Available at http://hdl.handle.net/2142/18477. Google Scholar
Digital Library
- Andrei Popescu, Elsa L. Gunter, and Christopher J. Osborn. Strong normalization of System F by HOAS on top of FOAS. In LICS, pages 31--40, 2010. Google Scholar
Digital Library
- Masahiko Sato and Robert Pollack. External and internal syntax of the lambda-calculus. Journal of Symbolic Computation, 45: 598--616, 2010. Google Scholar
Digital Library
- Carsten Schurmann and Frank Pfenning. Automated theorem proving in a simple meta-logic for LF. In CADE, pages 286--300, 1998. Google Scholar
Digital Library
- Carsten Schurmann, Joelle Despeyroux, and Frank Pfenning. Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci., 266 (1-2): 1--57, 2001. Google Scholar
Digital Library
- Masako Takahashi. Parallel reductions in lambda-calculus. Inf. Comput., 118 (1): 120--127, 1995. Google Scholar
Digital Library
- Christian Urban. Nominal techniques in Isabelle/HOL. J. Autom. Reason., 40 (4): 327--356, 2008. Google Scholar
Digital Library
- Christian Urban and Stefan Berghofer. A recursion combinator for nominal datatypes implemented in Isabelle/HOL. In IJCAR, pages 498--512, 2006. Google Scholar
Digital Library
- Christian Urban and Cezary Kaliszyk. General bindings and alpha-equivalence in Nominal Isabelle. In ESOP, pages 480--500, 2011. Google Scholar
Digital Library
- Christian Urban and Christine Tasson. Nominal techniques in Isabelle/HOL. In CADE, pages 38--53, 2005. Google Scholar
Digital Library
- Christian Urban, James Cheney, and Stefan Berghofer. Mechanizing the metatheory of LF. In LICS, pages 45--56, 2008. Google Scholar
Digital Library
- Makarius Wenzel, Lawrence C. Paulson, and Tobias Nipkow. The isabelle framework. In TPHOLs, pages 33--38, 2008. Google Scholar
Digital Library
Index Terms
Recursion principles for syntax with bindings and substitution
Recommendations
Recursion principles for syntax with bindings and substitution
ICFP '11: Proceedings of the 16th ACM SIGPLAN international conference on Functional programmingWe characterize the data type of terms with bindings, freshness and substitution, as an initial model in a suitable Horn theory. This characterization yields a convenient recursive definition principle, which we have formalized in Isabelle/HOL and ...
Bindings as bounded natural functors
We present a general framework for specifying and reasoning about syntax with bindings. Abstract binder types are modeled using a universe of functors on sets, subject to a number of operations that can be used to construct complex binding patterns and ...
Theory support for weak higher order abstract syntax in Isabelle/HOL
LFMTP '09: Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and PracticeWe describe the theoretical underpinnings to support the construction of an extension to the Isabelle/HOL theorem prover to support the creation of datatypes for weak higher-order abstract syntax, and give an example of its application. This theoretical ...







Comments