scientific article
From MaRDI portal
Publication:3659755
zbMath0514.03009MaRDI QIDQ3659755
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
A characterization of F-complete type assignments ⋮ Intersection type assignment systems ⋮ Type theories, normal forms, and \(D_{\infty}\)-lambda-models ⋮ Polymorphic extensions of simple type structures. With an application to a bar recursive minimization ⋮ A completeness result for a realisability semantics for an intersection type system ⋮ Intersection and union types ⋮ Developing developments ⋮ Decidability of bounded higher-order unification ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Finite Combinatory Logic with Intersection Types ⋮ Complete restrictions of the intersection type discipline ⋮ Intersection types for combinatory logic ⋮ Unnamed Item ⋮ Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ A completeness result for the simply typed \(\lambda \mu \)-calculus ⋮ The completeness theorem for typing lambda-terms
This page was built for publication: