The following pages link to (Q3659755):
Displayed 13 items.
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- A completeness result for a realisability semantics for an intersection type system (Q882122) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Developing developments (Q1392147) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)
- Completeness of type assignment systems with intersection, union, and type quantifiers (Q5958301) (← links)