Sciweavers

PPDP
2004
Springer

A lazy narrowing calculus for declarative constraint programming

13 years 7 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given constraint domain D. In this paper we extend such framework with a suitable operational semantics, which relies on a new constrained lazy narrowing calculus for goal solving parameterized by a constraint solver over the given domain D. This new calculus is sound and strongly complete w.r.t. the declarative semantics of CFLP(D) programs, which was formalized in [24] by means of a Constraint Rewriting Logic CRWL(D). Categories and Subject Descriptors
Francisco Javier López-Fraguas, Mario Rodr&
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where PPDP
Authors Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda
Comments (0)