We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...