Sciweavers

150 search results - page 2 / 30
» Understanding Promise Theory Using Rewriting Logic
Sort
View
PPDP
2007
Springer
13 years 11 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
ENTCS
2006
142views more  ENTCS 2006»
13 years 5 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
PPDP
2004
Springer
13 years 10 months ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
LATA
2009
Springer
14 years 1 days ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
POPL
2005
ACM
14 years 5 months ago
Enterprise privacy promises and enforcement
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
Adam Barth, John C. Mitchell