Constraint-set satisfiability for overloading

Authors:
Carlos Camarão;Lucília Figueiredo;Cristiano Vasconcellos
Affiliations:
University Fed. de Minas Gerais, Belo Horizonte, Brasil;University Federal de Ouro Preto, Ouro Preto, Brasil;Pontifícia University Católica do Paraná, Curitiba, Brasil
Venue:
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2004

Citing 21
Cited 1

Polymorphic type inference and containment

Information and Computation - Semantics of Data Types
How to make ad-hoc polymorphism less ad hoc

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric type classes

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Polymorphic type inference for languages with overloading and subtyping

Polymorphic type inference for languages with overloading and subtyping
Type inference with polymorphic recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Haskell overloading is DEXPTIME-complete

Information Processing Letters
Principal type schemes for functional programs with overloading and subtyping

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Lower bounds on type checking overloading

Information Processing Letters
A second look at overloading

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Simplifying and improving qualified types

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Kinded type inference for parametric overloading

Acta Informatica
Type classes in Haskell

ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of programming languages

Foundations of programming languages
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Open and closed scopes for constrained genericity

Theoretical Computer Science
A theory of overloading

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric Overloading in Polymorphic Programming Languages

ESOP '88 Proceedings of the 2nd European Symposium on Programming
On the Complexity of ML Typability with Overloading

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Type Inference for Overloading without Restrictions, Declarations or Annotations

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Type-checking multi-parameter type classes

Journal of Functional Programming

Overloading is NP-Complete

Logic and Program Semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article discusses the problem of constraint-set satisfiability (CSSAT) --- that is, the problem of determining whether a given constraint-set is satisfiable in a given typing context --- in the context of systems with support for overloading and parametric polymorphism. The paper reviews previous works on constraint-set satisfiability, showing that overloading policies used in order to guarantee decidability of CSSAT have been generally too restrictive. An algorithm is proposed that does not impose a severe restriction on possible overloadings and decides CSSAT in an expectedly vast majority of cases of practical interest. In cases for which satisfiability cannot be decided, a configurable limit on the number of iterations is used to guarantee termination.