Sciweavers

9626 search results - page 1647 / 1926
» Invariant Based Programming
Sort
View
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
16 years 1 days ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
CP
2004
Springer
16 years 1 days ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
CPAIOR
2004
Springer
16 years 1 days ago
Models and Symmetry Breaking for 'Peaceable Armies of Queens'
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
Barbara M. Smith, Karen E. Petrie, Ian P. Gent
CSL
2004
Springer
16 years 1 days ago
Axioms for Delimited Continuations in the CPS Hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard call-by-value CPS translation, Danvy ...
Yukiyoshi Kameyama
CSL
2004
Springer
16 years 1 days ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark
« Prev « First page 1647 / 1926 Last » Next »