Sciweavers

1458 search results - page 10 / 292
» Monads for incremental computing
Sort
View
LICS
2003
IEEE
14 years 3 months ago
Spectra of Monadic Second-Order Formulas with One Unary Function
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one fu...
Yuri Gurevich, Saharon Shelah
CC
2003
Springer
141views System Software» more  CC 2003»
14 years 3 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
Olivier Danvy
ENTCS
2002
114views more  ENTCS 2002»
13 years 9 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
ENTCS
2010
112views more  ENTCS 2010»
13 years 10 months ago
From Coalgebraic to Monoidal Traces
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coprodu...
Bart Jacobs