scientific article; zbMATH DE number 18625

MaRDI QIDQ3976029zbMATH OpenFDO

Authors Jerzy Tiuryn

Publication date 26 June 1992

zbMATH Keywords

decidabilityunificationpolymorphic \(\lambda\)-calculussemi-unificationtype inference problem

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 445157
• THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F
• The complexity of type inference for higher-order typed lambda calculi
• A semantics for static type inference
• scientific article; zbMATH DE number 1638659

Cited in

(15)

• The implication and finite implication problems for typed template dependencies
• scientific article; zbMATH DE number 445157 (Why is no real title available?)
• Abstract data type systems
• Geometry of synthesis III
• Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
• An empirical study into COBOL type inferencing
• Existential type systems between Church and Curry style (type-free style)
• Type inference for polymorphic references
• Erratum to ``Efficient inference of object types
• Type Preservation as a Confluence Problem
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• scientific article; zbMATH DE number 1512625 (Why is no real title available?)
• Polymorphic type inference for the relational algebra
• A semantics for type checking
• Domain-free \(\lambda\mu\)-calculus

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