Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.
Eager functions as processes
- We present a fully abstract encoding of the lambda-calculus in the pi-calculus.
We study Milner's encoding of the call-by-value λ-calculus into the π-calculus. We show that, by tuning the encoding to two subcalculi of the π-calculus (Internal π and Asynchronous Local π), the equivalence on λ-terms induced by the ...
Model checking QCTL plus on quantum Markov chains
- The logic QCTL+ extends QCTL by allowing conjunction and negation in atomic path formulas.
Verifying temporal properties of quantum systems, including quantum Markov chains (QMCs), has attracted an increasing interest in the last decade. Typically, the properties are specified by quantum computation tree logic (QCTL), in ...
Formal semantics of a classical-quantum language
- A classical-quantum imperative language with an operational and denotational semantics.
We investigate the formal semantics of a simple imperative language that has both classical and quantum constructs. More specifically, we provide an operational semantics, a denotational semantics and two Hoare-style proof systems: an ...
Behavioural logics for configuration structures
We provide a behavioural logic for configuration structures, a model due to van Glabbeek and Plotkin which generalises the families of (finite) configurations of event structures. The logic is a conservative extension of a logic ...
Generic recursive lens combinators and their calculation laws
- We provide a set of generic recursive lens combinators for constructing bidirectional programs.
Bidirectional transformation is a generic method for synchronizing two related data structures, with applications in databases, software model transformation, graph transformation, etc. Since the data to synchronize often have ...
Information systems for continuous semi-lattices
We consider two problems on representation theory for domains by information systems. The first problem is how to represent continuous semi-lattices as information systems, and the second one is which subclass of the continuous ...
On distributability
The Actor model of computation is the backbone for the design of some of the most successful distributed programming platforms, Erlang and Akka. It builds upon asynchronous message-passing (liberating senders from waiting) and unique ...
Highlights
- Theory and practice of distributed systems.
- Absolute expressive power.
