1226 search results - page 65 / 246 » Proofs, Programs and Abstract Complexity |
134
click to vote
MST
2010
15 years 1 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
121
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
127
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
122
click to vote
PEPM
1993
ACM
15 years 7 months ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
134
click to vote
GPCE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. SafeGen is a meta-programming language for writing statically safe generators of Java programs. If a program generator written in SafeGen passes the checks of the SafeGen...