scientific article; zbMATH DE number 512796

MaRDI QIDQ4281489zbMATH OpenFDO

Authors Paweł Urzyczyn

Publication date 7 April 1994

zbMATH Keywords

type-reconstructionundecidabilityuntyped lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Type reconstruction in F_ω
• scientific article; zbMATH DE number 445160
• scientific article; zbMATH DE number 445157
• Typability and type checking in System F are equivalent and undecidable

Cited in

(9)

• Type reconstruction in finite rank fragments of the second-order -calculus
• Typability and type checking in System F are equivalent and undecidable
• scientific article; zbMATH DE number 4134007 (Why is no real title available?)
• scientific article; zbMATH DE number 445157 (Why is no real title available?)
• scientific article; zbMATH DE number 445160 (Why is no real title available?)
• scientific article; zbMATH DE number 512777 (Why is no real title available?)
• Type reconstruction in F_ω
• scientific article; zbMATH DE number 1086674 (Why is no real title available?)
• The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281489)