Giovanna M. Dore

Learn More
We consider the Constraint Logic Programming paradigm CLP(X), as deened by Jaaar and Lassez 29, 28]. CLP(X) integrates a generic computational mechanism based on constraints within the logic programming framework. The paradigm retains the semantic properties of pure logic programs, namely the existence of equivalent operational, model-theoretic and xpoint(More)
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside(More)
  • 1