2012/02/16 by Axel Haddad
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.77.4
published as EPTCS 77, 2012, pp. 23-30 · In Proceedings FICS 2012, arXiv:1202.3174
arxiv created 2012/02/16 · arxiv updated 2012/02/17
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.