Sciweavers

51 search results - page 4 / 11
» The Equational Theory of Fixed Points with Applications to G...
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
13 years 7 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
JELIA
2004
Springer
14 years 23 days ago
Combining Decision Procedures for Sorted Theories
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to ...
Cesare Tinelli, Calogero G. Zarba
JCC
2002
127views more  JCC 2002»
13 years 7 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
POPL
2005
ACM
14 years 7 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
ACL2
2006
ACM
13 years 11 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray