367 search results - page 41 / 74 » A Rewriting Logic Sampler |
PLILP
1993
Springer
14 years 13 hour ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
POPL
1994
ACM
14 years 10 hour ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
AMAST
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
TRETS
2010
13 years 2 months ago
2010
A ring oscillator based true-random number generator design (Rings design) was introduced in [1]. The design was rigorously analyzed under a mathematical model and its performance...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...