Sciweavers

378 search results - page 53 / 76
» Higher-order transformation of logic programs
Sort
View
FLOPS
2008
Springer
13 years 11 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio
ESOP
2000
Springer
14 years 1 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
ICFEM
2009
Springer
13 years 7 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
ICFP
2004
ACM
14 years 9 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
ALP
1990
Springer
14 years 1 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar