Sciweavers

1458 search results - page 39 / 292
» Extended Term Rewriting Systems
Sort
View
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
15 years 4 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
FUIN
2008
88views more  FUIN 2008»
14 years 9 months ago
Validating Behavioral Component Interfaces in Rewriting Logic
Many distributed applications can be understood in terms of components interacting in an open environment such as the Internet. Open environments are subject to change in unpredic...
Einar Broch Johnsen, Olaf Owe, Arild B. Torjusen
CSL
2002
Springer
14 years 9 months ago
Open Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Herman Geuvers, Gueorgui I. Jojgov
ENTCS
2002
128views more  ENTCS 2002»
14 years 9 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
CSL
2005
Springer
15 years 3 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui