Sciweavers

71 search results - page 1 / 15
» An Abstract Way to Define Rewriting Logic
Sort
View
64
Voted
ENTCS
2006
146views more  ENTCS 2006»
14 years 10 months ago
An Abstract Way to Define Rewriting Logic
act way to define rewriting logic Marc Aiguier a,1 , Diane Bahrami b , Delphine Longuet a a Universit
Marc Aiguier, Diane Bahrami, Delphine Longuet
ENTCS
2006
142views more  ENTCS 2006»
14 years 10 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
83
Voted
BDA
2004
14 years 11 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...
102
Voted
PLILP
1995
Springer
15 years 1 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
94
Voted
AGP
1994
IEEE
15 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
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,...
María Alpuente, Moreno Falaschi, Marí...