A semantic characterization of the well-typed formulae of \(\lambda\)- calculus

DOI10.1016/0304-3975(93)90014-KzbMath0821.03007MaRDI QIDQ1208735

Thomas Forster

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

model of typed \(\lambda\)-calculusmodel-theoretic operation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Cites Work

• When is a variety a topos ?
• Model theory.
• Permutations and stratified formulae a preservation theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A semantic characterization of the well-typed formulae of \(\lambda\)- calculus