scientific article; zbMATH DE number 937379
From MaRDI portal
zbMATH Open0857.03005MaRDI QIDQ4896520FDOQ4896520
Authors: Alessandro Berarducci 
Publication date: 20 October 1996
Title of this publication is not available (Why is that?)
Recommendations
mute termsBöhm treesinfinitary version of \(\lambda\)-calculusmodel of \(\lambda\beta\)-calculusunsolvable lambda-terms
Cited In (27)
- Models of \(\lambda\)-calculus and the weak MSO logic
- Infinitary combinatory reduction systems
- Graph easy sets of mute lambda terms
- Title not available (Why is that?)
- A finite equational axiomatization of the functional algebras for the lambda calculus
- The infinitary lambda calculus of the infinite eta Böhm trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection types for \(\lambda\)-trees
- Innocent game models of untyped \(\lambda\)-calculus
- Infinite \(\lambda\)-calculus and types
- Infinitary lambda calculus
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Applications of infinitary lambda calculus
- Infinitary lambda calculus and discrimination of Berarducci trees.
- On the algebraic models of lambda calculus
- On modularity in infinitary term rewriting
- Skew confluence and the lambda calculus with letrec
- A class of bounded functions, a database language and an extended lambda calculus
- Highlights in infinitary rewriting and lambda calculus
- Encoding many-valued logic in $\lambda$-calculus
- Simple easy terms
- Easy lambda-terms are not always simple
- Clocked lambda calculus
- Comparing Böhm-Like Trees
- From Böhm's theorem to observational equivalences: an informal account
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896520)
