

Full simply typed lambda calculus is the simply typed lambda calculus extended with product types and sum types. We propose a Kripke-style semantics for full simply typed lambda calculus. We then prove soundness and completeness of type assignment in full simply typed lambda calculus with respect to the proposed semantics. The key point in the proof of completeness is the notion of a canonical model. © The Author(s) 2020.
| Engineering controlled terms: | Differentiation (calculus)Semantics |
|---|---|
| Engineering uncontrolled terms | Canonical modelingKeypointsKripke-style semanticsProduct typesSimply typed lambda calculusSoundness and completeness |
| Engineering main heading: | Calculations |
Kašterović, S.; Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;
© Copyright 2021 Elsevier B.V., All rights reserved.