407 search results - page 41 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
CAV
2009
Springer
13 years 11 months ago
2009
Springer
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
JUCS
2006
13 years 7 months ago
2006
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
TCS
2010
13 years 6 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...