It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...