IO vs OI in Higher-Order Recursion Schemes

Autor: Axel Haddad
Jazyk: angličtina
Rok vydání: 2012
Předmět:
Zdroj: Electronic Proceedings in Theoretical Computer Science, Vol 77, Iss Proc. FICS 2012, Pp 23-30 (2012)
Druh dokumentu: article
ISSN: 2075-2180
DOI: 10.4204/EPTCS.77.4
Popis: 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.
Databáze: Directory of Open Access Journals