Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least interpreted semantics in every Scott’s model of λ-calculus in which the terminals are interpreted as continuous operations. For the uninterpreted semantics based on infinite λ-terms we follow the idea of Fiore, Plotkin and Turi and work in the category of sets in context, which are presheaves on the category of finite sets. Whereas Fiore et al proved that the presheaf F λ of λ-terms is an initial H λ -monoid, we work with the presheaf R λ of rational infinite λ-terms and prove that this is an initial iterative H λ -monoid. We conclude that every guarded higher-order recursion scheme has a unique uninterpreted solution in R λ .
KeywordsHigher-order recursion schemes infinite λ-terms sets in context rational tree
Unable to display preview. Download preview PDF.
- 4.Damm, W.: Higher-order program schemes and their languages. LNCS, vol. 48, pp. 51–72. Springer, Heidelberg (1979)Google Scholar
- 5.Fiore, M.: Second order dependently sorted abstract syntax. In: Proc. Logic in Computer Science 2008, pp. 57–68. IEEE Press, Los Alamitos (2008)Google Scholar
- 6.Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc. Logic in Computer Science 1999, pp. 193–202. IEEE Press, Los Alamitos (1999)Google Scholar
- 14.Miranda, G.: Structures generated by higher-order grammars and the safety constraint. Ph.D. Thesis, Merton College, Oxford (2006)Google Scholar
- 15.Power, J.: A unified category theoretical approach to variable binding. In: Proc. MERLIN 2003 (2003)Google Scholar