IO vs OI in Higher-Order Recursion Schemes

Details IO vs OI in Higher-Order Recursion Schemes IO vs OI in Higher-Order Recursion Schemes

2012-02-16

arxiv.org/abs/1202.3498v1

EPTCS 77, 2012, pp. 23-30

Computer Science

Logic in Computer Science

In Proceedings FICS 2012, arXiv:1202.3174

Scientific paper

10.4204/EPTCS.77.4

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.

Affiliated with

Also associated with

No associations

Rating

IO vs OI in Higher-Order Recursion Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with IO vs OI in Higher-Order Recursion Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and IO vs OI in Higher-Order Recursion Schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124930