Pages that link to "Item:Q1839242"
From MaRDI portal
The following pages link to The completeness theorem for typing lambda-terms (Q1839242):
Displaying 35 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- A completeness result for the simply typed \(\lambda \mu \)-calculus (Q732057) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result (Q809993) (← links)
- A completeness result for a realisability semantics for an intersection type system (Q882122) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- On the semantics of polymorphism (Q1835664) (← links)
- Curry's type-rules are complete with respect to the F-semantics too (Q1839243) (← links)
- Term-space semantics of typed lambda calculus (Q1981989) (← links)
- Subtypes in fuzzy type theory (Q2328911) (← links)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- Meeting of the Association for Symbolic Logic Florence, Italy 1982 (Q3686697) (← links)
- Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
- Type inference with simple subtypes (Q4939703) (← links)
- A semantics for type checking (Q5096209) (← links)
- Intersection and union types (Q5096243) (← links)
- On dinaturality, typability and \(\beta\eta\)-stable models (Q5111327) (← links)
- Typed equivalence, type assignment, and type containment (Q5881295) (← links)
- Precise Subtyping for Asynchronous Multiparty Sessions (Q5886521) (← links)
- Completeness of type assignment systems with intersection, union, and type quantifiers (Q5958301) (← links)
- Primitive recursive functional with dependent types (Q6116568) (← links)
