Sciweavers

152 search results - page 5 / 31
» A Self-Applicable Partial Evaluator for Term Rewriting Syste...
Sort
View
ICLP
1997
Springer
14 years 17 days ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
LISP
2006
77views more  LISP 2006»
13 years 8 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
WWW
2011
ACM
13 years 3 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
ESWS
2008
Springer
13 years 10 months ago
Viewing and Querying Topic Maps in terms of RDF
Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purpo...
Silvia Stefanova, Tore Risch
CADE
2012
Springer
11 years 10 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur