Closures and Modules Within Linear Logic Concurrent Constraint Programming

DOI10.1007/978-3-540-77050-3_45zbMath1135.68367OpenAlexW1503552388MaRDI QIDQ5458864

François Fages, Sylvain Soliman, Rémy Haemmerlé

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_45

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Dynamic spaces in concurrent constraint programming, Abstract interpretation of temporal concurrent constraint programs, Subexponential concurrent constraint programming, Models and emerging trends of concurrent constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• Logic programming in a fragment of intuitionistic linear logic
• Linear concurrent constraint programming: Operational and phase semantics
• A Proof-Theoretic Approach to Logic Programming
• Theory and practice of constraint handling rules
• A modular module system
• Logic programming in the context of multiparadigm programming: the Oz experience
• Modules for Prolog Revisited