4370 search results - page 596 / 874 » Algebra of Logic Programming |
136
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
108
click to vote
MSCS
1998
15 years 4 months ago
1998
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
123
click to vote
TC
1998
15 years 4 months ago
1998
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
118
click to vote
TAP
2010
Springer
15 years 2 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
169
click to vote
ENTCS
2010
15 years 2 months ago
2010
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...