Вы здесь

Главная

перезапись

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

Abstract Rewriting
A Complete Characterization of Termination of 0 1 - 1 0
A confluent reduction for the lambda-calculus with surjective pairing and terminal object
Agg - An Implementation of Algebraic Graph Rewriting
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time
An Explicit Eta Rewrite Rule
An Improved General Path Order
An Object Calculus with Algebraic Rewriting
A Rewrite Approach for Constraint Logic Programming
A Rewrite Mechanism for Logic Programs with Negation
A Rewriting Technique for the Analysis and the Optimization of Active Databases
A Semantic Approach to Order-Sorted Rewriting
A Solution to Zantema s Problem
A specialized completion procedure for monadic string-rewriting systems presenting groups
Associative-Commutative Discrimination Nets
A Taste of Rewrite Systems
ATLAS: A Typed Language for Algebraic Specification
A Transformation Systems Combining Partial Evaluation with Term Rewriting
BDL - A Nondeterministic Data Flow Programming Language with Backtracking
Bottom-up Tree Rewriting Tool MBURG
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
Comparing Combinatory Reducion Systems and Higher-Order Rewrite Systems
Compilation of Combinatory Reduction Systems
Conditional and Typed Rewriting Systems: Proc./4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994
Conditional Rewriting Logic as a Unified Model of Concurrency
Conditional Term Rewriting Systems: Proc./Third Intern. Workshop, CTRS-92. Pont-a-Mousson, France, July 1992
Confluence and Superdevelopments
Constructs, Concepts and Criteria for Reuse in Concurrent Object-Oriented Languages
Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications
CPO models for infinite term rewriting
Critical Pairs in Term Graph Rewriting
Decidability of Regularity and Related Properties of Ground Normal Form Languages
Dynamic Graphs
Efficient Graph Rewriting and Its Implementation
Extending PowerEpsilon with Algebraic Rewriting
Graph Reducibility of Term Rewriting Systems
Graph Rewriting: An Algebraic and Logic Approach
Graph Rewriting Semantics for Functional Programming Languages
(Head-)Normalization of Typeable Rewrite Systems
Higher-Order Algebra, Logic, and Term Rewriting: Selected Papers/First Intern. Workshop, HOA 93. Amsterdam, The Netherlands, September 1993
Higher Order Conditional Rewriting and Narrowing
How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
Hybrid implementations of algebraic specifications
Hyperedge Replacement with Rendezvous
Implementing Inequality and Nondeterministic Specifications with Bi-rewriting Systems
Interaction Systems
Lazy Narrowing: Strong Completeness and Eager Variable Elimination
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Mapping Tile Logic into Rewriting Logic
MERILL: An Equational Reasoning System in Standard ML