APAL
2002
13 years 4 months ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
ENTCS
2007
13 years 4 months ago
2007
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 ...
ALP
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
PEPM
2004
ACM
13 years 10 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...