The following pages link to Extensional PERs (Q1193589):
Displaying 11 items.
- Inheritance as implicit coercion (Q1175335) (← links)
- Monads and algebras in the semantics of partial data types (Q1193894) (← links)
- Some economic applications of Scott domains (Q1196207) (← links)
- Independence of the induction principle and the axiom of choice in the pure calculus of constructions (Q1199547) (← links)
- Partial map classifiers and partial cartesian closed categories (Q1349664) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- From term models to domains (Q5096213) (← links)
- Lifting theorems for Kleisli categories (Q5890054) (← links)
- Domains in \(H\) (Q5941556) (← links)
- Synthetic domain theory in type theory: another logic of computable functions (Q6567725) (← links)
