351 search results - page 14 / 71 » Nominal Equational Logic |
CADE
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
BIRTHDAY
2006
Springer
14 years 13 days ago
2006
Springer
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
BIRTHDAY
2006
Springer
14 years 13 days ago
2006
Springer
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
ICLP
1995
Springer
14 years 7 days ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
RTA
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...