## Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves (1995)

Venue: | THEORETICAL COMPUTER SCIENCE |

### BibTeX

@ARTICLE{Gallier95provingproperties,

author = {Jean Gallier},

title = {Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves},

journal = {THEORETICAL COMPUTER SCIENCE},

year = {1995},

volume = {142}

}

### OpenURL

### Abstract

The main purpose of this paper is to take apart the reducibility method in order to understand how its pieces fit together, and in particular, to recast the conditions on candidates of reducibility as sheaf conditions. There has been a feeling among experts on this subject that it should be possible to present the reducibility method using more semantic means, and that a deeper understanding would then be gained. This paper gives mathematical substance to this feeling, by presenting a generalization of the reducibility method based on a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory). A key technical ingredient is the introduction a new class of semantic structures equipped with preorders, called pre-applicative structures. These structures need not be extensional. In this framework, a general realizability theorem can be shown. Kleene's recursive realizability and a variant of Kreisel's modified realizability both fit into this...