A semantic characterization of the well-typed formulae of λ-calculus

Thomas Forster
1993 Theoretical Computer Science  
Forster, T., A semantic characterization of the well-typed formulae of i-calculus, Theoretical Computer Science I IO (1993) 405-418. A model-theoretic operation is characterized that preserves the property of being a model of typed i-calculus (i.e.. the result of applying it to a model of typed i.-calculus is another model of typed i-calculus). An expression is well-typed iff the class of its models is closed under this operation.
doi:10.1016/0304-3975(93)90014-k fatcat:nmhhp7k7irbk3kvmp4uequa6pa