scientific article; zbMATH DE number 417312

MaRDI QIDQ3136282zbMATH OpenFDO

Authors Sophie Malecki

Publication date 23 January 1994

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

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

Cited in

(4)

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