منابع مشابه
Infinitary Lambda Calculus Innnitary Lambda Calculus
In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, whic...
متن کاملHighlights in infinitary rewriting and lambda calculus
We present some highlights from the emerging theory of infinitary rewriting, both for first-order term rewriting systems and λ-calculus. In the first section we introduce the framework of infinitary rewriting for first-order rewrite systems, so without bound variables. We present a recent observation concerning the continuity of infinitary rewriting. In the second section we present an excursio...
متن کاملCoinductive Techniques in Infinitary Lambda-Calculus
The main aim of this paper is to promote a certain informal but rigorous style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose we develop a theory which may serve as a reasonably direct justification for coinductive proofs written in this informal style, i.e., converting an informal coinductive proof into a non-coinductive argument m...
متن کاملFinitary Corecursion for the Infinitary Lambda Calculus
Kurz et al. have recently shown that infinite λ-trees with finitely many free variables modulo α-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of that functor. We prove that it is formed by all rational λtrees, i.e. those λ-trees which have only finitely many subtrees (up to isomorphism). This yields a corecursion pri...
متن کاملWeakening the Axiom of Overlap in Infinitary Lambda Calculus
In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So far only a set of sufficient conditions was known for choosing a suitable set of meaningless terms to make this construction produce confluent extensions. The conditions covered the three main known examp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00171-5