Sciweavers

4218 search results - page 53 / 844
» Complete sets of cooperations
Sort
View
ICFP
2003
ACM
14 years 7 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
FOSSACS
2010
Springer
14 years 2 months ago
Completeness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Sam Staton
LPAR
2007
Springer
14 years 1 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
ASWEC
2010
IEEE
13 years 8 months ago
Non-Monotonic Model Completion in Web Application Engineering
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
Jevon M. Wright, Jens Dietrich
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 7 months ago
Complete Axiomatizations for Reasoning About Knowledge and Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
Joseph Y. Halpern, Ron van der Meyden, Moshe Y. Va...