IO vs OI in Higher-Order Recursion Schemes

Axel Haddad

We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given that higher-order recursion schemes can be used as a model of functional programs, innermost-outermost derivations policy represents a theoretical view point of call by value evaluation strategy.

In Dale Miller and Zoltán Ésik: Proceedings 8th Workshop on Fixed Points in Computer Science (FICS 2012), Tallinn, Estonia, 24th March 2012, Electronic Proceedings in Theoretical Computer Science 77, pp. 23–30.
Published: 14th February 2012.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: