Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Standardization and Confluence for a Lambda Calculus with Generalized Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
de Bruijn notation as a nested datatype
Journal of Functional Programming
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theoretical Computer Science
| Hi-index | 5.23 |
The coinductive λ-calculus Aco arises by a coinductive interpretation of the grammar of the standard λ-calculus A and contains non-well-founded λ-terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/Martin-Löf style development argument. This yields bounds for the lengths of those joining reduction sequences that are guaranteed to exist by confluence. These bounds also apply to the well-founded λ-calculus, thus adding quantitative information to the classic result.