Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...