scientific article; zbMATH DE number 417312

zbMATH Open0779.03006MaRDI QIDQ3136282FDOQ3136282

Sophie Malecki

Publication date: 23 January 1994

Title of this publication is not available (Why is that?)

Recommendations

• Typability and type checking in System F are equivalent and undecidable
• Publication:3035256
• Alpha-conversion and typability
• scientific article
• THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F

zbMATH Keywords

second-order lambda calculusweak version of system \(F\)

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (4)

• Discussion on: ``On Aizerman's type problem for neutral type systems
• THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F
• Syntactical data types of system \(\mathcal F\)
• The \(I\)-types of system \(\mathcal F\)

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 Q3136282)