Sciweavers

1278 search results - page 205 / 256
» On the Semantics of Logic Program Composition
Sort
View
ICLP
2005
Springer
15 years 10 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
140
Voted
SOCO
2009
Springer
15 years 11 months ago
Specifying and Composing Non-functional Requirements in Model-Based Development
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...
PPDP
2009
Springer
15 years 9 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
ICFP
2003
ACM
16 years 4 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
PPDP
2010
Springer
15 years 2 months ago
Equational axiomatization of call-by-name delimited control
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...
Yukiyoshi Kameyama, Asami Tanaka