Recursion principles for syntax with bindings and substitution

Popescu, Andrei and Gunter, Elsa (2011) Recursion principles for syntax with bindings and substitution. In: The 16th ACM SIGPLAN International Conference on Functional Programming, 19-21 Sep 2011, Tokyo.

Full text is not in this repository.

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

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15169
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 23 Apr 2015 09:34
Last Modified: 13 Oct 2016 14:33
URI: https://eprints.mdx.ac.uk/id/eprint/15169

Actions (login required)

Edit Item Edit Item