Name
Abstract | ||
|---|---|---|
Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no more than one solution to a set of constraints. We now introduce two forms of Constraint Lambda Calculi which allow for multiple constraint solutions. Moreover the language also permits the use of disjunctions between constraints rather than just conjunction. These calculi are the Unrestricted, and the Restricted, Disjunctive Constraint-Lambda Calculi. We establish a limited form of confluence for the unrestricted calculus and a stronger form for the restricted one. We also discuss the denotational semantics of our calculi and some implementation issues. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11591191_6 | LPAR |
Keywords | Field | DocType |
implementation issue,constraint solver,denotational semantics,disjunctive constraint-lambda calculi,disjunctive constraint lambda calculus,stronger form,functional programming,limited form,constraint lambda calculi,simple case,multiple constraint solution | Discrete mathematics,Constraint satisfaction,Lambda calculus,Functional programming,Computer science,Constraint programming,Denotational semantics,Algorithm,Constraint satisfaction problem,Constraint logic programming,Lambda | Conference |
Volume | ISSN | ISBN |
3835 | 0302-9743 | 3-540-30553-X |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias M. Hölzl | 1 | 36 | 4.97 |
| John N. Crossley | 2 | 230 | 23.93 |