Sciweavers

21 search results - page 2 / 5
» flops 2010
Sort
View
FLOPS
2010
Springer
14 years 5 months ago
A Pearl on SAT Solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Jacob M. Howe, Andy King
FLOPS
2010
Springer
14 years 5 months ago
Automatically Generating Counterexamples to Naive Free Theorems
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
Daniel Seidel, Janis Voigtländer
FLOPS
2010
Springer
13 years 9 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
FLOPS
2010
Springer
14 years 4 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
FLOPS
2010
Springer
14 years 5 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka