BibTeX
@MISC{Joachimski01confluenceof,
author = {Felix Joachimski},
title = {Confluence of the Coinductive Lambda-Calculus},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The coinductive -calculus co arises by a coinductive interpretation of the grammar of the standard -calculus and contains non-wellfounded -terms. An appropriate notion of reduction is analyzed and proven to be conuent by means of a detailed analysis of the usual Tait/MartinL of style development argument. This yields bounds for the lengths of those joining reduction sequences that are guaranteed to exist by conuence. These bounds also apply to the wellfounded -calculus.
Citations
| 997 | The Lambda Calculus: its Syntax and Semantics - Barendregt - 1984 |
| 279 | Universal coalgebra: a theory of systems - Rutten - 2000 |
| 89 | Proof Theory - Schütte - 1977 |
| 68 | Monadic presentations of lambda terms using generalized inductive types - Altenkirch, Reus - 1999 |
| 66 | Infinite Objects in Type Theory - Coquand - 1993 |
| 62 | De Bruijn notation as a nested datatype - Bird, Paterson - 1999 |
| 20 | Abstract syntax and variable binding (extended abstract), in - Fiore, Plotkin, et al. - 1999 |
| 13 | Ensuring streams flow - Telford, Turner - 1997 |
| 5 | Jan-Willem Klop, Ronan Sleep, and FerJan de Vries. In lambda calculus - Kennaway - 1997 |
| 4 | Standardization and con for a lambda calculus with generalized applications - Joachimski, Matthes - 2000 |
