38 search results - page 2 / 8 » Monads and Modular Term Rewriting |
RTA
2011
Springer
12 years 8 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
IFL
2004
Springer
13 years 10 months ago
2004
Springer
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
AGP
1994
IEEE
13 years 9 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
ESORICS
2007
Springer
13 years 11 months ago
2007
Springer
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...
BIRTHDAY
2005
Springer
13 years 11 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...