407 search results - page 31 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
AGP
1997
IEEE
13 years 12 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...