Sciweavers

185 search results - page 9 / 37
» The Rewriting Logic Semantics Project
Sort
View
PPDP
2007
Springer
14 years 2 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
CIKM
2011
Springer
12 years 8 months ago
Semantic data markets: a flexible environment for knowledge management
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...
Roberto De Virgilio, Giorgio Orsi, Letizia Tanca, ...
FLOPS
2008
Springer
13 years 10 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
POPL
2002
ACM
14 years 8 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ADT
2006
13 years 8 months ago
LicenseScript: a logical language for digital rights management
We propose LicenseScript, a language for digital rights management (DRM) based on multiset rewriting and logic programming. LicenseScript enjoys a precise syntax and semantics, an...
Cheun Ngen Chong, Ricardo Corin, Jeroen Doumen, Sa...