Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational adequacy for recursive types in models of intuitionistic set theory |
scientific article; zbMATH DE number 2116240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational adequacy for recursive types in models of intuitionistic set theory |
scientific article; zbMATH DE number 2116240 |
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
