Recursion over realizability structures (Q1173956): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Metric interpretations of infinite trees and semantics of non deterministic recursive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional models for polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive types for Fun / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type theories, normal forms, and \(D_{\infty}\)-lambda-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theoretic models of polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small complete category / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interpretation of intuitionistic number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ideal model for recursive polymorphic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic type inference and containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial morphisms in categories of effective objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point constructions in order-enriched categories / rank
 
Normal rank

Latest revision as of 08:48, 15 May 2024

scientific article
Language Label Description Also known as
English
Recursion over realizability structures
scientific article

    Statements

    Recursion over realizability structures (English)
    0 references
    0 references
    25 June 1992
    0 references
    realizability structures
    0 references
    complete partial orders
    0 references
    Scott domain
    0 references
    Cartesian closed category
    0 references
    higher-order lambda-calculus
    0 references
    fixed-point operator
    0 references
    inductive types
    0 references
    contractive operators
    0 references
    higher-order domain equations
    0 references
    modelling of recursive definitions of programs and types
    0 references
    realizability model
    0 references
    Girard's system \(F\)
    0 references
    recursion on types
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references