Closures and Modules Within Linear Logic Concurrent Constraint Programming
From MaRDI portal
Publication:5458864
DOI10.1007/978-3-540-77050-3_45zbMATH Open1135.68367OpenAlexW1503552388MaRDI QIDQ5458864FDOQ5458864
Authors: Rémy Haemmerlé, François Fages, Sylvain Soliman
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
Recommendations
Cites Work
- Logic programming in a fragment of intuitionistic linear logic
- Linear concurrent constraint programming: Operational and phase semantics
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- Theory and practice of constraint handling rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Proof-Theoretic Approach to Logic Programming
- Logic programming in the context of multiparadigm programming: the Oz experience
- A modular module system
- Title not available (Why is that?)
- Modules for Prolog Revisited
Cited In (5)
This page was built for publication: Closures and Modules Within Linear Logic Concurrent Constraint Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458864)