Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
Abstract. Component-oriented programming yields a tension between higherorder features (deployment, reconfiguration, passivation), encapsulation, and component sharing. We propose...
Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, A...