72 search results - page 13 / 15 » From Monadic Logic to PSL |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
CONSTRAINTS
2007
13 years 7 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
PPDP
2010
Springer
13 years 5 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...