Explicit substitutions and higher-order syntax
- 1 September 2006
- journal article
- research article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 19 (2-3) , 263-282
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Iteration and coiteration schemes for higher-order and nested datatypesTheoretical Computer Science, 2005
- Infinite trees and completely iterative theories: a coalgebraic viewTheoretical Computer Science, 2003
- On Rational Monads and Free Iterative TheoriesElectronic Notes in Theoretical Computer Science, 2003
- Free iterative theories: a coalgebraic viewMathematical Structures in Computer Science, 2003
- Generalised folds for nested datatypesFormal Aspects of Computing, 1999
- Monadic Presentations of Lambda Terms Using Generalized Inductive Types1999
- de Bruijn notation as a nested datatypeJournal of Functional Programming, 1999
- An abstract framework for environment machinesTheoretical Computer Science, 1991
- Explicit substitutionsJournal of Functional Programming, 1991
- A presentation of topoi as algebraic relative to categories or graphsJournal of Algebra, 1983