Sciweavers

351 search results - page 26 / 71
» Nominal Equational Logic
Sort
View
PEPM
2004
ACM
14 years 2 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é...
ICFP
2005
ACM
14 years 8 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
CADE
2006
Springer
14 years 14 days ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
CADE
2006
Springer
14 years 9 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
PDP
2005
IEEE
14 years 2 months ago
Distributed Local Resolution of Boolean Equation Systems
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
Christophe Joubert, Radu Mateescu