Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1013963.1013974 | PPDP |
Keywords | Field | DocType |
configurable limit,constraint-set satisfiability,possible overloadings,overloading policy,parametric polymorphism,severe restriction,previous work,practical interest,typing context,expectedly vast majority,satisfiability,polymorphism,ad hoc polymorphism | Programming language,Computer science,Ad hoc polymorphism,Satisfiability,Parametric polymorphism,Theoretical computer science,Decidability | Conference |
ISBN | Citations | PageRank |
1-58113-819-9 | 5 | 0.53 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Camarão | 1 | 17 | 5.74 |
| Lucília Figueiredo | 2 | 15 | 4.33 |
| Cristiano Vasconcellos | 3 | 7 | 1.91 |