30 search results - page 5 / 6 » Continuation semantics for the Lambek-Grishin calculus |
IEEEARES
2006
IEEE
14 years 9 days ago
2006
IEEE
The µKlaim calculus is a process algebra designed to study the programming of distributed systems consisting of a number of locations each having their own tuple space and collec...
LFCS
2007
Springer
14 years 12 days ago
2007
Springer
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
CALCO
2009
Springer
14 years 25 days ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
ICFP
2006
ACM
14 years 6 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...