378 search results - page 8 / 76 » Higher-order transformation of logic programs |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
TYPES
2000
Springer
14 years 4 hour ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
IEICET
2007
13 years 8 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...