By Topic

On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Geuvers, H. ; Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands ; Werner, B.

We consider two alternative definitions for the conversion rule in pure type systems. We study the consequences of this choice for the metatheory and point out the related implementation issues. We relate two open problems by showing that if a PTS allows the construction of a fixed point combinator, then Church-Rosser for βη-reduction fails. We present a new formalization of Russell's paradox in a slight extension of Martin-Lof's inconsistent theory with Type:Type and show that the resulting term leads to a fix-point construction. The main consequence is that the corresponding system is non-confluent. This example shows that in some typed λ-calculi, the Church-Rosser proof for the βη-reduction is not purely combinatorial anymore, as in pure λ-calculus, but relies on the normalization and thus the logical consistency of the system

Published in:

Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on

Date of Conference:

4-7 Jul 1994