The following pages link to (Q3960746):
Displaying 19 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- On stable domains (Q685428) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- Inconsistency and semantic unification (Q853424) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Type 2 recursion theory (Q1073021) (← links)
- Universal profinite domains (Q1093371) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Domains for logic programming (Q1185016) (← links)
- Function spaces, cartesian closedness and nonstandard methods (Q1203547) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- Constructive domain theory as a branch of intuitionistic pointfree topology (Q1350507) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Domain theoretic models of polymorphism (Q1824612) (← links)
- Computer science and decision theory (Q2271874) (← links)
- An adequacy theorem for dependent type theory (Q2311883) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- Almost Every Domain is Universal (Q5262933) (← links)
