Pages that link to "Item:Q1886324"
From MaRDI portal
The following pages link to Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324):
Displaying 12 items.
- Relating first-order set theories, toposes and categories of classes (Q386623) (← links)
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic (Q952487) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- On the adequacy of representing higher order intuitionistic logic as a pure type system (Q1194249) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Weighted models for higher-order computation (Q2216134) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- An operational domain-theoretic treatment of recursive types (Q2851325) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- Relating First-Order Set Theories and Elementary Toposes (Q3533518) (← links)
- A Brief Introduction to Algebraic Set Theory (Q3616432) (← links)
- Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction (Q6649494) (← links)
