HIGHLIGHTS
- What: The authors show how to implement term algebras over a signature without resorting to general inductive constructions (currently not allowed in UniMath) still retaining the computational nature of the definition. The authors provide a detailed account of the full construction of the term algebra from ground up starting from the inductive type of natural numbers and deriving step-by-step the necessary intermediate structures such as (heterogeneous) vectors and lists. Without recurring to general inductive types, in Terms.v the authors implement this notion using an alternative device, based on reverse Polish notation and value stacks . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.