Sciweavers

754 search results - page 70 / 151
» Nested Expressions in Logic Programs
Sort
View
JELIA
1990
Springer
13 years 12 months ago
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
Vaughan R. Pratt
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 11 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ESOP
2003
Springer
14 years 1 months ago
Finite Differencing of Logical Formulas for Static Analysis
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...
Thomas W. Reps, Shmuel Sagiv, Alexey Loginov
ENTCS
2007
82views more  ENTCS 2007»
13 years 8 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
ENTCS
2002
83views more  ENTCS 2002»
13 years 7 months ago
Operational Semantics for Functional Logic Languages
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...