IO vs OI in Higher-Order Recursion Schemes

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

Full description

Bibliographic Details
Main Author: Axel Haddad
Format: Article
Language:English
Published: Open Publishing Association 2012-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1202.3498v1
id doaj-418788f5fa8449838a700268d1a85b14
record_format Article
spelling doaj-418788f5fa8449838a700268d1a85b142020-11-25T00:02:28ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-02-0177Proc. FICS 2012233010.4204/EPTCS.77.4IO vs OI in Higher-Order Recursion SchemesAxel HaddadWe 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.http://arxiv.org/pdf/1202.3498v1
collection DOAJ
language English
format Article
sources DOAJ
author Axel Haddad
spellingShingle Axel Haddad
IO vs OI in Higher-Order Recursion Schemes
Electronic Proceedings in Theoretical Computer Science
author_facet Axel Haddad
author_sort Axel Haddad
title IO vs OI in Higher-Order Recursion Schemes
title_short IO vs OI in Higher-Order Recursion Schemes
title_full IO vs OI in Higher-Order Recursion Schemes
title_fullStr IO vs OI in Higher-Order Recursion Schemes
title_full_unstemmed IO vs OI in Higher-Order Recursion Schemes
title_sort io vs oi in higher-order recursion schemes
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-02-01
description 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.
url http://arxiv.org/pdf/1202.3498v1
work_keys_str_mv AT axelhaddad iovsoiinhigherorderrecursionschemes
_version_ 1725437523615809536

Similar Items