An Extension of the Formulas-as-Types Paradigm

DOI10.1017/S0012217300009288MaRDI QIDQ4252864zbMATH OpenOpenAlexFDO

Authors J. Lambek

Publication date 28 October 1999

Published in Dialogue (Search for Journal in Brave)

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

zbMATH Keywords

deductive systemformulas-as-types paradigmfunctional completenessGentzen sequents with zero formulasrefutationstype theory

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 1696616
• A relational formulation of the theory of types
• A typed functional extension of logic programming
• scientific article; zbMATH DE number 960927
• Dependent types and formal synthesis
• scientific article; zbMATH DE number 1265030
• A Rewriting Logic Approach to Type Inference
• Extensional constructs in intensional type theory
• A Rewriting Semantics for Type Inference
• scientific article; zbMATH DE number 5872250

Cited in

(3)

• A short note on type-inhabitation: formula-trees vs. game semantics
• scientific article; zbMATH DE number 1696616 (Why is no real title available?)
• scientific article; zbMATH DE number 960927 (Why is no real title available?)

This page was built for publication: An Extension of the Formulas-as-Types Paradigm

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