42 search results - page 7 / 9 » Modular Equivalence for Normal Logic Programs |
114
click to vote
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
111
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
114
click to vote
TLCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
143
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
120
click to vote
CAEPIA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...