A standardisation proof for algebraic pattern calculi

Details A standardisation proof for algebraic pattern calculi A standardisation proof for algebraic pattern calculi

2011-02-18

arxiv.org/abs/1102.3734v1

EPTCS 49, 2011, pp. 58-72

Computer Science

Logic in Computer Science

In Proceedings HOR 2010, arXiv:1102.3465

Scientific paper

10.4204/EPTCS.49.5

This work gives some insights and results on standardisation for call-by-name pattern calculi. More precisely, we define standard reductions for a pattern calculus with constructor-based data terms and patterns. This notion is based on reduction steps that are needed to match an argument with respect to a given pattern. We prove the Standardisation Theorem by using the technique developed by Takahashi and Crary for lambda-calculus. The proof is based on the fact that any development can be specified as a sequence of head steps followed by internal reductions, i.e. reductions in which no head steps are involved.

Affiliated with

Also associated with

No associations

Rating

A standardisation proof for algebraic pattern calculi 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 A standardisation proof for algebraic pattern calculi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A standardisation proof for algebraic pattern calculi will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211419