IO vs OI in Higher-Order Recursion Schemes

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 o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Electronic proceedings in theoretical computer science 2012-02, Vol.77 (Proc. FICS 2012), p.23-30
1. Verfasser:	Haddad, Axel
Format:	Artikel
Sprache:	eng
Schlagworte:	Computation and Language Computer Science Computer Science and Game Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	2075-2180 2075-2180
DOI:	10.4204/EPTCS.77.4