Lower bounds on type checking overloading

DOI10.1016/0020-0190(95)00184-0zbMath0875.68541OpenAlexW2074241102MaRDI QIDQ1350740

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)

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of type polymorphism in programming
• Haskell overloading is DEXPTIME-complete
• Principal type schemes for functional programs with overloading and subtyping
• Tree acceptors and some of their applications
• Polymorphic type inference with overloading and subtyping

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