Turing, in his immortal 1936 paper, observed that “[human] computing is normally done by writing. . . symbols on [two-dimensional] paper”, but noted that use of a second dimen...
The transition from a theory that turned out trivial to a consistent replacement need not proceed in terms of inconsistencies, which are negation gluts. Logics that tolerate gluts...
Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably e...
This paper intends to contribute to the debate about the uses of paraconsistent reasoning in the foundations of set theory, by means of employing the logics of formal inconsistenc...
The LFP Framework is an extension of the Harper-Honsell-Plotkin’s Edinburgh Logical Framework LF with external predicates, hence the name Open Logical Framework. This is accompli...
Furio Honsell, Marina Lenisa, Ivan Scagnetto, Luig...
Justification logics refine modal logics by replacing the usual necessity operator with a family of justification terms that embody reasons for the necessity of a formula, rath...
An eye-tracking study compared the effects of actions (depicted as tools between on-screen characters) with those of a speaker’s gaze and head shift between the same two charact...
This paper develops a new language for programming softwaredefined networks based on a probabilistic semantics. We extend the NetKAT language with new primitives for expressing p...
Abstract. Staged programming languages assign a stage to each program expression and evaluate each expression in its assigned stage. A common use of staged languages is to describe...
Nicolas Feltman, Carlo Angiuli, Umut A. Acar, Kayv...
Most programs interact with the world: via graphical user interfaces, networks, etc. This form of interactivity entails concurrency, and concurrent program components must coordina...