367 search results - page 42 / 74 » A Rewriting Logic Sampler |
121
Voted
RTA
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
110
click to vote
TYPES
1998
Springer
15 years 4 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
96
Voted
LISP
2008
15 years 13 days ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
84
Voted
APAL
2010
15 years 18 days ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
105
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...