On mints’ reduction for ccc-calculus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)

Abstract

In this paper, we present a divide-and-conquer lemma to infer the SN+CR (Strongly Normalization and Church-Rosser) property of a reduction system from that property of its subsystems. Then we apply the lemma to show the property of Mints’ reduction for ccc-calculus with restricted ν-expansion and restricted π-expansion. In the course of the proof, we obtain some relations of the two restricted expansions against traditional reductions. Among others, we get a simple characterization of the restricted ν-expansion in terms of traditional β-and ν-reductions, and a similar characterization for the restricted π-expansion.

Original languageEnglish
Title of host publicationTyped Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings
EditorsMarc Bezem, Jan Friso Groote
PublisherSpringer Verlag
Pages1-12
Number of pages12
ISBN (Print)9783540565178
DOIs
Publication statusPublished - 1993
Externally publishedYes
Event1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993 - Utrecht, Netherlands
Duration: 1993 Mar 161993 Mar 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume664 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993
CountryNetherlands
CityUtrecht
Period93/3/1693/3/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On mints’ reduction for ccc-calculus'. Together they form a unique fingerprint.

Cite this