Вы здесь

Главная

перезапись

Связанные издания:

Modular Termination of Term Rewriting Systems Revisited
More Problems in Rewriting
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs
On the Adequancy of Graph Rewriting for Simulating Term Rewriting
Optimal Reductions in Interaction Systems
Origin Tracking for Higher-Order Term Rewriting Systems
Partial Ordering Models for Concurrency Can Be Defined Operationally
Prolog with Term Rewriting as a Functional Component
Rational Rewriting
Reasoning and Rewriting with Set-Relations I: Ground Completeness
Reduce the Redex - ReDuX
Regular Path Expressions in Feature Logic
Rewriting: An Effective Model of Concurrency
Rewriting Properties of Combinators for Rudimentary Linear Logic
Rewriting Rule Methods in Logic Databases
Rewriting Techniques and Applications: Proc./10th Intern. Conf., RTA-99. Trento, Italy, July 1999
Rewriting Techniques and Applications: Proc./11th Intern. Conf., RTA 2000. Norwich, UK, July 2000
Rewriting Techniques and Applications: Proc./13th Intern. Conf., RTA 2002, Copenhagen, Denmark, July 2002
Rewriting Techniques and Applications: Proc./15th International Conference,RTA 2004. Aachen,Germany,June 2004
Rewriting Techniques and Applications: Proc./5th Intern. Conf., RTA-93. Montreal, Canada, June 1993
Rewriting Techniques and Applications: Proc./6th Intern. Conf., RTA-95. Kaiserslautern, Germany, April 1995
Rewriting Techniques and Applications: Proc./8th Intern. Conf., RTA-97. Sitges, Spain, June 1997
Rewriting Techniques and Applications: Proc./9th Intern. Conf., RTA-98. Tsukuba, Japan, March-April 1998
Rewriting Techniques for Software Engineering
Rewriting with Constraints in T-Ruby
Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems
Simple Termination is Difficult
Simple Termination of Hierarchical Combinations of Term Rewriting Systems
Simulation of SOS Definitions with Term Rewriting Systems
Strategies in Modular System Design by Interface Rewriting
Strict Functionals for Termination Proofs
Strong Normalization of Typeable Rewrite Systems
Syntactic Definitions of Undefined: On Defining the Underfined
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq
Termination Proofs for Higher-Order Rewrite Systems
Term Rewriting Analysis in Process Algebra
Term Rewriting in CT
The Design and Implementation of a Program Development System Based on Rewriting Method
Total Termination of Term Rewriting
True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication
Type Checking for a Multiset Rewriting Language
Typed Lambda Calculi and Applications: Proc./Second Intern. Conf. on Typed Lambda Calculi and Applications, TLCA 95. Edinburgh, United Kingdom, April 1995
Weak Orthogonality Implies Confluence: The Higher-Order Case