Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:09, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational adequacy for recursive types in models of intuitionistic set theory |
scientific article |
Statements
Computational adequacy for recursive types in models of intuitionistic set theory (English)
0 references
18 November 2004
0 references
Domain theory
0 references
Algebraic compactness
0 references
FPC
0 references
interpretation of recursive types
0 references
categorical models of intuitionistic set theory
0 references
recursively typed lambda-calculus
0 references
