A finite axiomatization of propositional type theory in pure lambda calculus

zbMATH Open1226.03019MaRDI QIDQ3086781FDOQ3086781

Authors: Mark Kaminski, Gert Smolka 

Publication date: 30 March 2011

Recommendations

• scientific article; zbMATH DE number 823591
• Some lambda calculus and type theory formalized
• scientific article; zbMATH DE number 2185659
• scientific article; zbMATH DE number 1342246
• scientific article; zbMATH DE number 512879

zbMATH Keywords

propositional type theorysimply typed lambda termspure lambda calculusset-theoretic type hierarchy

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (5)

• Title not available (Why is that?)
• Axioms for the Theory of Lambda-Conversion
• Probabilistic approach to the lambda definability for fourth order types
• Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves
• Axiomatic rewriting theory II: the   -calculus enjoys finite normalisation cones

Uses Software

• ETPS

This page was built for publication: A finite axiomatization of propositional type theory in pure lambda calculus

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