researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
1987
1988
1990
1991
1992
1993
1994
1995
Filter by Tag
[+]
OR
AND
NOT
1
algebra
C++
algebraic specification
compiler
completeness
consistency
e-science
graph-rewriting
logic
logic programming
rewriting
rewriting logic
rule-based
rules
semantics
systematic-approach
term rewriting
termination
testing
type system
Filter by Author
[+]
OR
AND
NOT
1
Aart Middeldorp
Alexander Bockmayr
Andreas Werner
Bernhard Gramlich
Charles Hoot
Chilukuri K. Mohan
Claus-Peter Wirth
David A. Plaisted
Detlef Plump
Emmanuel Kounalis
Enno Ohlebusch
François Bronsard
Hans Zantema
Harald Ganzinger
Jean-Luc Remy
José Meseguer
Michaël Rusinowitch
Nachum Dershowitz
Stéphane Kaplan
Wadoud Bousdira
Filter by Top terms
[+]
OR
AND
NOT
1
abstract
algebraic
calculus
completion
conditional
confluence
equational
extended
linear
logic
order
proving
rewrite
rewriting
semantics
specifications
systems
term
termination
type
CTRS (ctrs)
Editions
Publications
Viewing Publication 1 - 100 from 126
1995
Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings
Nachum Dershowitz
,
Naomi Lindenstrauss
, editors,
Volume 968 of
Lecture Notes in Computer Science
, Springer,
1995.
1994
Associative-Commutative Superposition
Leo Bachmair
,
Harald Ganzinger
.
ctrs 1995
:
1-14
Equation Solving in Geometrical Theories
Philippe Balbiani
.
ctrs 1995
:
31-50
A Calculus for Rippling
David A. Basin
,
Toby Walsh
.
ctrs 1995
:
15-30
LSE Narrowing for Decreasing Conditional Term Rewrite Systems
Alexander Bockmayr
,
Andreas Werner
.
ctrs 1995
:
51-70
Preserving Confluence for Rewrite Systems with Built-in Operations
Reinhard Bündgen
.
ctrs 1995
:
71-88
Hierachical Termination
Nachum Dershowitz
.
ctrs 1995
:
89-105
Well-foundedness of Term Orderings
Maria C. F. Ferreira
,
Hans Zantema
.
ctrs 1995
:
106-123
Relative Normalization in Orthogonal Expression Reduction Systems
John R. W. Glauert
,
Zurab Khasidashvili
.
ctrs 1995
:
144-165
On Termination and Confluence of Conditional Rewrite Systems
Bernhard Gramlich
.
ctrs 1995
:
166-185
A New Characterisation of AC-Termination and Application
Jean-Michel Gélis
.
ctrs 1995
:
124-143
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
Claus Hintermeier
.
ctrs 1995
:
186-205
Termination for Restricted Derivations and Conditional Rewrite Systems
Charles Hoot
.
ctrs 1995
:
206-222
Rewriting for Preorder Relations
Paola Inverardi
.
ctrs 1995
:
223-234
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems
Jean-Pierre Jouannaud
,
Walid Sadfi
.
ctrs 1995
:
235-246
A Conflict Between Call-by-Need Computation and Parallelism
Richard Kennaway
.
ctrs 1995
:
247-261
The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables
Gregory Kucherov
,
Michaël Rusinowitch
.
ctrs 1995
:
262-275
Coherence for Cartesian Closed Categories: A Sequential Approach
Akira Mori
,
Yoshihiro Matsumoto
.
ctrs 1995
:
276-295
Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems
Enno Ohlebusch
.
ctrs 1995
:
296-315
Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems
Yoshihito Toyama
,
Michio Oyamaguchi
.
ctrs 1995
:
316-331
The Transformation of Term Rewriting Sysstems Based on Well-formedness Preserving Mappings
Jan C. Verheul
,
Peter G. Kluit
.
ctrs 1995
:
332-352
Abstract Notions and Inference Systems for Proofs by Mathematical Induction
Claus-Peter Wirth
,
Klaus Becker
.
ctrs 1995
:
353-373
1993
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings
Michaël Rusinowitch
,
Jean-Luc Remy
, editors,
Volume 656 of
Lecture Notes in Computer Science
, Springer,
1993.
1992
Consistency and Semantics of Equational Definitions over Predefined Algebras
Valentin M. Antimirov
,
Anatoli Degtyarev
.
ctrs 1993
:
67-81
Normalization by Leftmost Innermost Rewriting
Sergio Antoy
.
ctrs 1993
:
448-457
Simple Type Inference for Term Graph Rewriting Systems
Richard Banach
.
ctrs 1993
:
51-66
Semantics for Positive/Negative Conditional Rewrite Systems
Klaus Becker
.
ctrs 1993
:
213-225
An Optimal Narrowing Strategy for General Canonical Systems
Alexander Bockmayr
,
Stefan Krischer
,
Andreas Werner
.
ctrs 1993
:
483-497
Logic Programs with Polymorphic Types: A condition for static type checking
Staffan Bonnier
,
Jonas Wallgren
.
ctrs 1993
:
438-447
Reduction Techniques for First-Order Reasoning
François Bronsard
,
Uday S. Reddy
.
ctrs 1993
:
242-256
A New Approach to General E-Unification Based on Conditional Rewriting Systems
Bertrand Delsart
.
ctrs 1993
:
468-482
Semigroups Satisfying x:::m+n::: = x:::n:::
Nachum Dershowitz
.
ctrs 1993
:
307-314
Path Orderings for Termination of Associative-Commutative Rewriting
Nachum Dershowitz
,
Subrata Mitra
.
ctrs 1993
:
168-174
Set-Of-Support Strategy for Higher-Order Logic
Wenchang Fang
,
Jung-Hong Kao
.
ctrs 1993
:
498-501
A Calculus for Conditional Inductive Theorem Proving
Ulrich Fraus
.
ctrs 1993
:
357-362
Inductive Theorem Proving by Consistency for First-Order Clauses
Harald Ganzinger
,
Jürgen Stuber
.
ctrs 1993
:
226-241
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems
Harald Ganzinger
,
Uwe Waldmann
.
ctrs 1993
:
430-437
Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems
Bernhard Gramlich
.
ctrs 1993
:
128-142
Computing Linearizations Using Test Sets
Dieter Hofbauer
,
Maria Huber
.
ctrs 1993
:
287-301
Completion for Constrained Term Rewriting Systems
Charles Hoot
.
ctrs 1993
:
408-423
A Strategy to Deal with Divergent Rewrite Systems
Paola Inverardi
,
Monica Nesi
.
ctrs 1993
:
458-467
Context Rewriting
Stefan Kahrs
.
ctrs 1993
:
21-35
Decidability of Regularity and Related Properties of Ground Normal Form Languages
Gregory Kucherov
,
Mohamed Tajine
.
ctrs 1993
:
272-286
Termination of Combined (Rewrite and lambda-Calculus) Systems
Carlos Loría-Sáenz
,
Joachim Steinbach
.
ctrs 1993
:
143-147
Algebraic Semantics of Rewriting Terms and Types
Karl Meinke
.
ctrs 1993
:
1-20
Completeness of Combinations of Conditional Constructor Systems
Aart Middeldorp
.
ctrs 1993
:
82-96
Combinations of Simplifying Conditional Term Rewriting Systems
Enno Ohlebusch
.
ctrs 1993
:
113-127
Decidability of finiteness properties (Abstract)
Leszek Pacholski
.
ctrs 1993
:
429
Generic Induction Proofs
Peter Padawitz
.
ctrs 1993
:
175-197
Conditional Term Rewriting and First-Order Theorem Proving
David A. Plaisted
,
Geoffrey D. Alexander
,
Heng Chu
,
Shie-Jue Lee
.
ctrs 1993
:
257-271
Collapsed Tree Rewriting: Completeness, Confluence, and Modularity
Detlef Plump
.
ctrs 1993
:
97-112
Explicit Cyclic Substitutions
Kristoffer Høgsbro Rose
.
ctrs 1993
:
36-50
A Categorical Formulation for Critical-Pair/Completion Procedures
Karel Stokkermans
.
ctrs 1993
:
328-342
Generalized Partial Computation using Disunification to Solve Constraints
Akihiko Takano
.
ctrs 1993
:
424-428
Could Orders Be Captured By Term Rewriting Systems?
Sergei G. Vorobyov
.
ctrs 1993
:
315-327
Trace Rewriting Systems
Yabo Wang
,
David Lorge Parnas
.
ctrs 1993
:
343-356
A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications
Claus-Peter Wirth
,
Bernhard Gramlich
.
ctrs 1993
:
198-212
Completeness and Confluence of Order-Sorted Term Rewriting
Lars With
.
ctrs 1993
:
393-407
Confluence of Terminating Membership Conditional TRS
Junnosuke Yamada
.
ctrs 1993
:
378-392
Type Removal in Term Rewriting
Hans Zantema
.
ctrs 1993
:
148-154
Termination of Term Rewriting by Interpretation
Hans Zantema
.
ctrs 1993
:
155-167
Implementing Contextual Rewriting
Hantao Zhang
.
ctrs 1993
:
363-377
Proving Group Isomorphism Theorems (Extended Abstract)
Hantao Zhang
.
ctrs 1993
:
302-306
1991
Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings
Stéphane Kaplan
,
Mitsuhiro Okada
, editors,
Volume 516 of
Lecture Notes in Computer Science
, Springer,
1991.
1990
An Universal Termination Condition for Solving Goals in Equational Languages
G. Aguzzi
,
U. Modigliani
,
M. Cecilia Verri
.
ctrs 1991
:
418-423
Compiling Concurrent Rewriting onto the Rewrite Rule Machine
Hitoshi Aida
,
Joseph A. Goguen
,
José Meseguer
.
ctrs 1991
:
320-332
Typed Equivalence, Type Assignment, and Type Containment
Roberto M. Amadio
.
ctrs 1991
:
372-382
An Application of Automated Equational Reasoning to Many-valued Logic
Siva Anantharaman
,
Maria Paola Bonacina
.
ctrs 1991
:
156-161
Design Strategies for Rewrite Rules
Sergio Antoy
.
ctrs 1991
:
333-341
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract)
Leo Bachmair
,
Harald Ganzinger
.
ctrs 1991
:
162-180
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved
Franco Barbanera
.
ctrs 1991
:
260-271
Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation
Hubert Bertling
.
ctrs 1991
:
181-193
Proof by Consistency in Conditional Equational Theories
Eddy Bevers
,
Johan Lewi
.
ctrs 1991
:
194-205
Completion Procedures as Semidecision Procedures
Maria Paola Bonacina
,
Jieh Hsiang
.
ctrs 1991
:
206-232
On Sufficient Completeness of Conditional Specifications
Wadoud Bousdira
,
Jean-Luc Remy
.
ctrs 1991
:
272-286
Conditional Rewriting in Focus
François Bronsard
,
Uday S. Francois
.
ctrs 1991
:
2-13
Testing Confluence of Nonterminating Rewriting Systems
Yiyun Chen
,
Michael J. O Donnell
.
ctrs 1991
:
127-136
Infinite Terms and Infinite Rewritings
Yiyun Chen
,
Michael J. O Donnell
.
ctrs 1991
:
115-126
Constrained Equational Deduction
John Darlington
,
Yike Guo
.
ctrs 1991
:
424-435
A Maximal-Literal Unit Strategy for Horn Clauses
Nachum Dershowitz
.
ctrs 1991
:
14-25
Linear Completion
Hervé Devie
.
ctrs 1991
:
233-245
A Fixed-Point Semantics for Feature Type Systems
Martin C. Emele
,
Rémi Zajac
.
ctrs 1991
:
383-388
A Simplifier for Untyped Lambda Expressions
Louis Galbiati
,
Carolyn L. Talcott
.
ctrs 1991
:
342-353
A Survey of Ordinal Interpretations of Type epsilon::0::for Termination of Rewriting Systems
Bernard R. Hodgson
,
Clement F. Kent
.
ctrs 1991
:
137-142
Meta-rule Synthesis from Crossed Rewrite Systems
Hélène Kirchner
,
Miki Hermann
.
ctrs 1991
:
143-154
Extended Term Rewriting Systems
Jan Willem Klop
,
Roel C. de Vrijer
.
ctrs 1991
:
26-50
A Proof System for Conditional Algebraic Specifications
Emmanuel Kounalis
,
Michaël Rusinowitch
.
ctrs 1991
:
51-63
FPL: Functional Plus Logic Programming: An Integration of the FP and Prolog Languages
N. Lichtenstein
,
Stéphane Kaplan
.
ctrs 1991
:
287-294
Conditional Rewriting Logic: Deduction, Models and Concurrency
José Meseguer
.
ctrs 1991
:
64-91
Confluence of the Disjoint Union of Conditional Term Rewriting Systems
Aart Middeldorp
.
ctrs 1991
:
295-306
Equivalences of Rewrite Programs
Chilukuri K. Mohan
.
ctrs 1991
:
92-97
Clausal Rewriting
Robert Nieuwenhuis
,
Fernando Orejas
.
ctrs 1991
:
246-258
Higher-Order Unification, Polymorphism, and Subsorts (Extended Abstract)
Tobias Nipkow
.
ctrs 1991
:
436-447
Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems
Detlef Plump
.
ctrs 1991
:
307-317
Second-Order Unification in the Presence of Linear Shallow Algebraic Equations (Extended Abstract)
Zhenyu Qian
.
ctrs 1991
:
448-453
An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality
Wayne Snyder
,
Christopher Lynch
.
ctrs 1991
:
454-461
Unique-Sort Order-Sorted Theories: A Description as Monad Morphisms
John G. Stell
.
ctrs 1991
:
389-400
Equational Logics (Birkhoff s Method Revisited)
Yong Sun
.
ctrs 1991
:
401-406
Parallel Graph Rewriting on Loosely Coupled Machine Architectures
Marko C. J. D. van Eekelen
,
Marinus J. Plasmeijer
,
J. E. W. Smetsers
.
ctrs 1991
:
354-369
Compatibility of Order-Sorted Rewrite Rules
Uwe Waldmann
.
ctrs 1991
:
407-416
Sign in
or
sign up
to see more results.