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

DOI10.1016/J.JLAMP.2017.09.005zbMATH Open1382.68050OpenAlexW2770745742MaRDI QIDQ1683705FDOQ1683705

Authors: 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

Recommendations

• On mereologies in computing science
• Mereology in engineering and computer science
• Compositionality: ontology and mereology of domains. Some clarifying observations in the context of software engineering
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 1929953

zbMATH Keywords

mereologydomain descriptionmanifest domain

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mereotopology: A theory of parts and boundaries
• Domain engineering
• Manifest domains: analysis and description
• Domain Endurants

Cited In (4)

• Selected papers from the 28th Nordic workshop on programming theory (NWPT'16)
• On mereologies in computing science
• Compositionality: ontology and mereology of domains. Some clarifying observations in the context of software engineering
• Domain modelling: a foundation for software development

This page was built for publication: To every manifest domain a CSP expression -- a rôle for mereology in computer science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683705)