Recursion over realizability structures☆

https://doi.org/10.1016/0890-5401(91)90074-CGet rights and content
Under an Elsevier user license
open archive

Abstract

Realizability structures play a major role in the metamathematics of intuitionistic systems and they are a basic tool in the extraction of the computational content of constructive proofs. Besides their rich categorical structure and effectiveness properties provide a privileged mathematical setting for the semantics of data types of programming languages. In this paper we emphasize the modelling of recursive definitions of programs and types. A realizability model for a language including Girard's system F and an operator of recursion on types is given and some of its local properties are studied.

Cited by (0)

☆

Preliminary ideas on this subject were presented in talks delivered at the LICS Conference (Edinburgh, July 1988) and at the EEC Jumelage meeting on Typed λ-calculus (Nijmegen, November 1988). This research was partly supported by the Joint Collaboration Contract #ST2J-0374-C (EDB) of the EEC.

Copyright © 1991 Published by Elsevier Inc.