scientific article; zbMATH DE number 937379
From MaRDI portal
Publication:4896520
zbMath0857.03005MaRDI QIDQ4896520
Publication date: 20 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Böhm treesmute termsinfinitary version of \(\lambda\)-calculusmodel of \(\lambda\beta\)-calculusunsolvable lambda-terms
Related Items (24)
Infinitary lambda calculus and discrimination of Berarducci trees. ⋮ Easy lambda-terms are not always simple ⋮ Graph easy sets of mute lambda terms ⋮ A class of bounded functions, a database language and an extended lambda calculus ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Infinitary lambda calculus ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ From Böhm's Theorem to Observational Equivalences ⋮ Infinitary combinatory reduction systems ⋮ On modularity in infinitary term rewriting ⋮ Intersection types for \(\lambda\)-trees ⋮ Innocent game models of untyped \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Comparing Böhm-Like Trees ⋮ Applications of infinitary lambda calculus ⋮ Infinite \(\lambda\)-calculus and types ⋮ A finite equational axiomatization of the functional algebras for the lambda calculus ⋮ Simple Easy Terms ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ On the algebraic models of lambda calculus ⋮ Skew confluence and the lambda calculus with letrec ⋮ Encoding many-valued logic in $\lambda$-calculus ⋮ The infinitary lambda calculus of the infinite eta Böhm trees ⋮ Clocked lambda calculus
This page was built for publication:
