Sciweavers

APAL
2002
83views more  APAL 2002»
14 years 10 days ago
Inherently nonfinitely based lattices
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...
Ralph Freese, George F. McNulty, James B. Nation
ENTCS
2007
105views more  ENTCS 2007»
14 years 12 days 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...
ALP
1994
Springer
14 years 4 months ago
Compositional Analysis for Equational Horn Programs
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...
María Alpuente, Moreno Falaschi, Germ&aacut...
PEPM
2004
ACM
14 years 5 months ago
Proving termination of membership equational programs
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...
Francisco Durán, Salvador Lucas, José...
LICS
2008
IEEE
14 years 6 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
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...
Dexter Kozen