scientific article
From MaRDI portal
Publication:3142167
zbMath0789.03017MaRDI QIDQ3142167
Publication date: 5 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitypartial type reconstructionpredicative fragmentpure polymorphic \(\lambda\)-calculussecond- order unification problem
Undecidability and degrees of sets of sentences (03D35) Combinatory logic and lambda calculus (03B40)
Related Items (8)
Existential type systems between Church and Curry style (type-free style) ⋮ Using typed lambda calculus to implement formal systems on a machine ⋮ The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types ⋮ COCHIS: Stable and coherent implicits ⋮ Existential Type Systems with No Types in Terms ⋮ Recasting ML\(^{\text F}\) ⋮ Typability and type checking in System F are equivalent and undecidable ⋮ Semi-explicit first-class polymorphism for ML.
This page was built for publication:
