Sciweavers

30 search results - page 3 / 6
» Continuation semantics for the Lambek-Grishin calculus
Sort
View
89
Voted
AAAI
1996
14 years 11 months ago
Reasoning about Continuous Processes
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
Christoph S. Herrmann, Michael Thielscher
77
Voted
ENTCS
2008
126views more  ENTCS 2008»
14 years 10 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
88
Voted
AB
2007
Springer
15 years 4 months ago
A Stochastic Pi Calculus for Concurrent Objects
We present SpiCO, a new modeling and simulation language for systems biology. SpiCO is based on the stochastic π-calculus. It supports higher level modeling via multi-profile con...
Céline Kuttler, Cédric Lhoussaine, J...
101
Voted
LICS
2006
IEEE
15 years 4 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
179
Voted
POPL
2009
ACM
15 years 11 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry