## Notes on Sconing and Relators (1993)

Citations: | 24 - 0 self |

### BibTeX

@INPROCEEDINGS{Mitchell93noteson,

author = {John C. Mitchell and Andre Scedrov},

title = {Notes on Sconing and Relators},

booktitle = {},

year = {1993},

pages = {352--378},

publisher = {Springer}

}

### OpenURL

### Abstract

This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a category-theoretic 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...