Sciweavers

45 search results - page 4 / 9
» On Modularity in Term Rewriting and Narrowing
Sort
View
PLILP
1993
Springer
15 years 1 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
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...
Rita Loogen, Francisco Javier López-Fraguas...
FLOPS
2008
Springer
14 years 11 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal
ESORICS
2007
Springer
15 years 3 months ago
Modular Access Control Via Strategic Rewriting
Abstract. Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular wa...
Daniel J. Dougherty, Claude Kirchner, Hél&e...
BIRTHDAY
2005
Springer
15 years 3 months ago
Term Rewriting Meets Aspect-Oriented Programming
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...
Paul Klint, Tijs van der Storm, Jurgen J. Vinju
LOPSTR
2009
Springer
15 years 4 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...