scientific article; zbMATH DE number 4061194

MaRDI QIDQ3795649zbMATH OpenFDO

Authors Peter B. Andrews

Publication date 1987

zbMATH Keywords

automated theorem provinglambda-calculussimple type theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40)

Cited in

(8)

• Infinite \(\lambda\)-calculus and types
• Some lambda calculus and type theory formalized
• Typed ψ-calculi
• Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
• Automath and Pure Type Systems
• The TPS theorem proving system
• Using typed lambda calculus to implement formal systems on a machine
• Mechanical procedure for proof construction via closed terms in typed calculus

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 Q3795649)