A foundation for higher-order concurrent constraint programming

DOI10.1007/BFb0016844zbMath1495.68044MaRDI QIDQ5096300

Gert Smolka

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

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

Related Items

Constraints as processes, Dynamic spaces in concurrent constraint programming, Proving concurrent constraint programming correct, revisited, A closer look at constraints as processes, Decoding choice encodings, Models and emerging trends of concurrent constraint programming, On concurrent behaviors and focusing in linear logic, On subexponentials, focusing and modalities in concurrent systems, Slicing concurrent constraint programs, Operational semantics for declarative multi-paradigm languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• A calculus of mobile processes. I
• A feature constraint system for logic programming with entailment
• Functions as processes
• Design, implementation, and evaluation of the constraint language cc(FD)
• Records for logic programming