Sciweavers

11 search results - page 2 / 3
» Continuity and Discontinuity in Lambda Calculus
Sort
View
ENTCS
2008
126views more  ENTCS 2008»
13 years 5 months ago
Comonadic Notions of Computation
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...
Tarmo Uustalu, Varmo Vene
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 3 months ago
Applying Universal Algebra to Lambda Calculus
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...
Giulio Manzonetto, Antonino Salibra
ICFP
2012
ACM
11 years 7 months ago
Propositions as sessions
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...
Philip Wadler
FLOPS
2004
Springer
13 years 10 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
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...
Masahito Hasegawa
PLDI
2006
ACM
13 years 10 months ago
Continuations and transducer composition
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...
Olin Shivers, Matthew Might