Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
—Opportunistic networks represent one of the most interesting evolution of MANET paradigm. Generally speaking, opportunistic networks enable user communication in environments wh...
In this paper, we aim to ascribe a meaning to SysML activity diagrams. To this end, we propose a dedicated algebraic-like language, namely activity calculus, and an operational se...