The Geometry of Linear Higher-Order Recursion

Details The Geometry of Linear Higher-Order Recursion The Geometry of Linear Higher-Order Recursion

2005-06-20

arxiv.org/abs/cs/0506080v2

Computer Science

Logic in Computer Science

23 pages, extended version of a paper appearing in LICS 2005 proceedings

Scientific paper

Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two constraints leads to different expressive strengths, some of them lying well beyond polynomial time. This is done by introducing a new semantics, called algebraic context semantics. The framework stems from Gonthier's original work and turns out to be a versatile and powerful tool for the quantitative analysis of normalization in presence of constants and higher-order recursion.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104053