Graph models of \lambda-calculus at work, and variations

DOI10.1017/S0960129506005123MaRDI QIDQ5481589zbMATH OpenOpenAlexFDO

Authors Chantal Berline

Publication date 10 August 2006

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129506005123

zbMATH Keywords

surveygraph modelsfunctional semantics\(\lambda\)-modelsequational extensions of untyped \(\lambda\)-calculus

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Combinatory logic and lambda calculus (03B40) Logical aspects of lattices and related structures (03G10)

Recommendations

• Graph lambda theories
• Lambda Theories of Effective Lambda Models
• Minimal \(\lambda\)-theories by ultraproducts
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 599151

Cited in

(8)

• Lambda Theories of Effective Lambda Models
• Effective λ-models versus recursively enumerable λ-theories
• Graph easy sets of mute lambda terms
• Mathematical Foundations of Computer Science 2003
• Minimal \(\lambda\)-theories by ultraproducts
• scientific article; zbMATH DE number 599151 (Why is no real title available?)
• Easy lambda-terms are not always simple
• Graph lambda theories

This page was built for publication: Graph models of $\lambda$-calculus at work, and variations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481589)