Recursion over realizability structures
- 1 March 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 91 (1) , 55-85
- https://doi.org/10.1016/0890-5401(91)90074-c
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Domain theoretic models of polymorphismInformation and Computation, 1989
- A small complete categoryAnnals of Pure and Applied Logic, 1988
- Extensional models for polymorphismTheoretical Computer Science, 1988
- Partial morphisms in categories of effective objectsInformation and Computation, 1988
- Polymorphic type inference and containmentInformation and Computation, 1988
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Metric interpretations of infinite trees and semantics of non deterministic recursive programsTheoretical Computer Science, 1980
- On the interpretation of intuitionistic number theoryThe Journal of Symbolic Logic, 1945
- Sur les opérations dans les ensembles abstraits et leur application aux équations intégralesFundamenta Mathematicae, 1922