63 search results - page 2 / 13 » Comparing Meseguer's Rewriting Logic with the Logic CRWL |
ENTCS
2007
13 years 7 months ago
2007
CL
2000
Springer
13 years 11 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
ENTCS
2007
13 years 7 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
ICTAC
2005
Springer
14 years 16 days ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.