IO vs OI in Higher-Order Recursion Schemes

Axel Haddad (1, 2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Informatique et théorie des jeux [cs.GT]; Informatique et langage [cs.CL]

Axel Haddad. IO vs OI in Higher-Order Recursion Schemes. Workshop on Fixed Points in Computer Science, Mar 2012, Tallinn, Estonia. pp.23-30, ⟨10.4204/EPTCS.77.4⟩. ⟨hal-00865681⟩