Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

Details Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

2009-12-30

arxiv.org/abs/0912.4947v3

LMCS 6 (1:7) 2010

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-6(1:7)2010

We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary lambda calculus.

Affiliated with

Also associated with

No associations

Rating

Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies 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 Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33647