Artigo Acesso aberto Revisado por pares

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

2017; Elsevier BV; Volume: 94; Linguagem: Inglês

10.1016/j.jlamp.2017.09.005

ISSN

2352-2216

Autores

Dines Bjørner,

Tópico(s)

Logic, programming, and type systems

Resumo

We give an abstract model1 of parts and part-hood relations, of Stanisław Leśniewski's mereology [2]. Mereology applies to software application domains such as the financial service industry, railway systems, road transport systems, health care, oil pipelines, secure [IT] systems, etc. We relate this model to axiom systems for mereology, showing satisfiability, and show that for every mereology there corresponds a class of Communicating Sequential Processes [3], that is: a λ-expression.

Referência(s)