The following pages link to (Q4068054):
Displaying 50 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- A language for generic programming in the large (Q532409) (← links)
- Preface to the special volume (Q534064) (← links)
- Type checking and typability in domain-free lambda calculi (Q655411) (← links)
- Divergence of \(F_{\leq}\) type checking (Q673966) (← links)
- Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category (Q687575) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Functorial polymorphism (Q753948) (← links)
- Generic constructions for behavioral specifications (Q764311) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Semantics of types for database objects (Q915443) (← links)
- A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
- A typed lambda calculus with intersection types (Q930870) (← links)
- Parameter-free polymorphic types (Q958481) (← links)
- A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras (Q1079357) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Pebble, a kernel language for modules and abstract data types (Q1104071) (← links)
- A semantics of multiple inheritance (Q1106652) (← links)
- The calculus of constructions (Q1108266) (← links)
- Polymorphic type inference and containment (Q1110312) (← 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)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Finitely stratified polymorphism (Q1175334) (← links)
- Recursive types for Fun (Q1176245) (← links)
- Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus (Q1193590) (← links)
- Categorical models of polymorphism (Q1193592) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- A theory of type polymorphism in programming (Q1250704) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- Higher-order subtyping (Q1392282) (← links)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- A domain-theoretic semantics of lax generic functions. (Q1398469) (← links)
- Generalized filter models (Q1575259) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- Atomic polymorphism and the existence property (Q1799037) (← links)
