Sciweavers

330 search results - page 49 / 66
» On Modular Termination Proofs of General Logic Programs
Sort
View
KBSE
2005
IEEE
14 years 1 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
POPL
2010
ACM
14 years 5 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 8 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
ICFP
2005
ACM
14 years 7 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
ACL2
2006
ACM
14 years 1 months ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager