An Algebra for Higher-Order Terms (Q7361834)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Higher_Order_Terms
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algebra for Higher-Order Terms |
AFP entry Higher_Order_Terms |
Statements
15 January 2019
0 references
Lars Hupel
0 references
Yu Zhang
0 references
An Algebra for Higher-Order Terms (English)
0 references
In this formalization, I introduce a higher-order term algebra, generalizing the notions of free variables, matching, and substitution. The need arose from the work on a verified compiler from Isabelle to CakeML . Terms can be thought of as consisting of a generic (free variables, constants, application) and a specific part. As example applications, this entry provides instantiations for de-Bruijn terms, terms with named variables, and Blanchette’s λ-free higher-order terms . Furthermore, I implement translation functions between de-Bruijn terms and named terms and prove their correctness.
0 references
