Sciweavers

5499 search results - page 9 / 1100
» Generalized Rewrite Theories
Sort
View
BIRTHDAY
2004
Springer
14 years 1 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
TCS
2002
13 years 7 months ago
Specification of real-time and hybrid systems in rewriting logic
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
Peter Csaba Ölveczky, José Meseguer
FROCOS
2009
Springer
14 years 2 months ago
Automating Theories in Intuitionistic Logic
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
Guillaume Burel
WADT
1998
Springer
13 years 11 months ago
Parallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
Rachid Echahed, Jean-Christophe Janodet
TLCA
2007
Springer
14 years 1 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek