525 search results - page 12 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
SAS
2009
Springer
14 years 7 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
SAS
2005
Springer
14 years 6 days ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
FLOPS
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
IWFM
1998
13 years 8 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
ECOOP
2004
Springer
14 years 3 days ago
2004
Springer
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...