To every manifest domain a CSP expression -- a rôle for mereology in computer science

DOI10.1016/j.jlamp.2017.09.005zbMath1382.68050OpenAlexW2770745742MaRDI QIDQ1683705

Dines Bjørner

Publication date: 1 December 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://backend.orbit.dtu.dk/ws/files/142124916/jlamp_mereo.pdf

zbMATH Keywords

mereologydomain descriptionmanifest domain

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Philosophical and critical aspects of logic and foundations (03A05) General topics in the theory of software (68N01)

Related Items

Selected papers from the 28th Nordic workshop on programming theory (NWPT'16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Manifest domains: analysis and description
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Domain Engineering
• Mereotopology: A theory of parts and boundaries
• Domain Endurants