The completeness of typing for context-semantics

MaRDI QIDQ3593495zbMATH OpenFDO

Authors Thierry Coquand

Publication date 20 July 2007

zbMATH Keywords

completenesscontext semanticstype theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• \(F\)-semantics for type assignment systems
• Résultats de complétude pour des classes de types du système $\mathcal {AF}2$
• On completeness and parametricity in the realizability semantics of System \textsf{F}
• A characterization of F-complete type assignments
• Term-space semantics of typed lambda calculus

Cited in

(4)

• scientific article; zbMATH DE number 5872251 (Why is no real title available?)
• Completeness in hybrid type theory
• An approach to completing variable names for implicitly typed functional languages
• scientific article; zbMATH DE number 226803 (Why is no real title available?)

This page was built for publication: The completeness of typing for context-semantics

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