Linear Recursion

Details Linear Recursion Linear Recursion

2010-01-19

arxiv.org/abs/1001.3368v3

Computer Science

Logic in Computer Science

24 pages

Scientific paper

We show that the full PCF language can be encoded in Lrec, a linear lambda-calculus extended with numbers, pairs and an unbounded recursor that preserves the syntactic linearity of the calculus. Thus, Lrec is a Turing complete extension of the linear lambda-calculus. We discuss evaluation strategies and implementation techniques for Lrec, exploiting the linearity of the system.

Affiliated with

Also associated with

No associations

Rating

Linear Recursion 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 Linear Recursion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Recursion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636921