584 search results - page 4 / 117 » Logic Programs as term Rewriting Systems |
98
Voted
JAR
2010
14 years 4 months ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
CTCS
1997
Springer
15 years 1 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
FLOPS
2010
Springer
14 years 8 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...