Results 1 
2 of
2
Notes on Sconing and Relators
, 1993
"... This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a categorytheoretic method of sconing, also called glueing or Freyd covers. Its correspondence to logical relations is also examined. 1 Introduction Many modern programming languages feature ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a categorytheoretic method of sconing, also called glueing or Freyd covers. Its correspondence to logical relations is also examined. 1 Introduction Many modern programming languages feature rather sophisticated typing mechanisms. In particular, languages such as ML include polymorphic data types, which allow considerable programming flexibility. Several notions of polymorphism were introduced into computer science by Strachey [Str67], among them the important notion of parametric polymorphism. Strachey's intuitive definition is that a polymorphic function is parametric if it has a uniformly given algorithm in all types, that is, if the function's behavior is independent of the type at which the function is instantiated. Reynolds [Rey83] proposed a mathematical definition of parametric polymorphic functions by means of invariance with respect to certain relations induced by typ...
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and LĂ¤uchli countermodels.
, 1996
"... We use formal semantic analysis based on new, modeltheoretic constructions to generate intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning. Wellknown modal semantic formalisms have been defined by Kripke and Beth, but these have no fo ..."
Abstract
 Add to MetaCart
We use formal semantic analysis based on new, modeltheoretic constructions to generate intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning. Wellknown modal semantic formalisms have been defined by Kripke and Beth, but these have no formal concepts corresponding to constructions, and shed little intuitive light on the meanings of formulae. In particular, the wellknown completeness proofs for these semantics do not generate confidence in the sufficiency of the Heyting Calculus, since we have no reason to believe that every intuitively constructive truth is valid in the formal semantics. Lauchli has proved completeness for a realizability semantics with formal concepts analogous to constructions, but the analogy is, in our view, inherently inexact. We argue in some detail that, in spite of this inexactness, every intuitively constructive truth is valid in Lauchli semantics, and therefore the Heyting Calculus is p...