Atlas home || Conferences | Abstracts | about Atlas

The Eleventh Summer Conference on General Topology and Applications
August 10-13, 1995
University of Southern Maine
Gorham, ME, USA

Organizers
J. Baumgartner, D. Briggs, J. deBakker, B. Flagg, G. Gruenhage, M. Guay, Y. Kong, R. Kopperman, S. Shore, J. Rutten, J. Vaughan

View Abstracts
Conference Homepage

A New Model Construction for Higher Type Systems
by
Dieter Spreen
Universität--GH Siegen

We present a model for the Girard-Reynolds second order lambda calculus which is not based on Scott domains. In this model types are interpreted as inverse limits [T\vec] of co-chains T0 <-- p0 T1 <-- p1 ... of finite topological T0-spaces such that the mappings pi are continuous and onto. The morphisms from [T\vec] to [(T')\vec] are sequences (fi)i >= 0 of maps fi in [Ti --> T'']. Here [T0 --> T'0] is the set of all continuous maps from T0 into T'0 and for i > 0, [Ti --> T'i] is the set of those continuous maps f : Ti --> T'i such that f \approx f and [f] \approx in [Ti-1 --> T'i-1] where \approx is the partial equivalence relation defined by
f \approx g iff ( for ally, z in Ti) [pi(y) = pi(z) implies pi'(f(y)) = pi'(g(z))]
and [f] \approx is the equivalence class of f under this relation. The spaces of all morphisms from [T\vec] to [(T')\vec] is thus again an inverse limit of a co-chain of finite T0-spaces. Moreover, its ith approximation depends only on the first i+1 approximations of [T\vec] and [(T')\vec], which means that it is rank preserving.

For each such constructor F a space \prodF can be constructed such that its ith approximation contains i-tuples of elements of the first i+1 approximations of F([T\vec]) for certain spaces [T\vec]. Moreover, a mapping Apply is defined such that for t in \prodF Apply(t, [T\vec]) in F([T\vec]). This is used to give meaning to the \Pi-type of second order lambda calculus.

Just as in the case of the function space dependent sums and products can be defined by taking them componentwise. In the same way one obtains power spaces. Thus, the model extends to a model of more powerful type systems.

Since the empty set can also be obtained as an inverse limit of a co-chain of finite T0-spaces, it follows that \prodX ·X = \emptyset. If one requires that the lowest set of any co-chain is the one-point space, then \prodX ·X =/= \emptyset. In case that only co-chains with | Ti | <= i are considered, then a slight modification of the construction yields a model of the Calculus of Construction.

Date received: April 12, 1996


Copyright © 1996 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caaf-79.