The following pages link to (Q3677139):
Displaying 14 items.
- Computational interpretations of linear logic (Q685430) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Meta-circular interpreter for a strongly typed language (Q908683) (← links)
- Type inference with subtypes (Q914357) (← 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)
- Algebraic processing of programming languages (Q1129126) (← links)
- Subtyping can have a simple semantics (Q1177151) (← links)
- Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- Type structures (Q3760531) (← links)
- The method of types [information theory] (Q4701200) (← links)
- Polymorphic type inference with overloading and subtyping (Q5044772) (← links)
- Inductively defined types in the Calculus of Constructions (Q5887516) (← links)
