Lower bounds on type checking overloading

DOI10.1016/0020-0190(95)00184-0MaRDI QIDQ1350740zbMATH OpenOpenAlexFDO

Authors Dennis M. Volpano

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00184-0

zbMATH Keywords

Computational complexityOverloadingType theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Type checking and problem of overloaded arguments
• scientific article; zbMATH DE number 3881858
• Basic polymorphic typechecking
• A denotational approach for type-checking in object-oriented programming languages
• Type checking with open type functions
• Type-checking multi-parameter type classes
• scientific article; zbMATH DE number 3928328
• Mechanisms for improved covariant type-checking

Cites work

• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 3349328 (Why is no real title available?)
• A theory of type polymorphism in programming
• Haskell overloading is DEXPTIME-complete
• Polymorphic type inference with overloading and subtyping
• Principal type schemes for functional programs with overloading and subtyping
• Tree acceptors and some of their applications

Cited in

(5)

• Type checking and problem of overloaded arguments
• Haskell overloading is DEXPTIME-complete
• Correct Hardware Design and Verification Methods
• A theory of overloading
• Functional logic overloading

Describes a project that uses

Uses Software

• ML

This page was built for publication: Lower bounds on type checking overloading

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