We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
On-line transducers are an important class of computational agent; we construct and compose together many software systems using them, such as stream processors, layered network p...