Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
rewriting
Связанные издания:
! = 1 Optimizing Optimal -calculus Implementations
A Complete Characterization of Termination of 0 1 - 1 0
A Restricted Form of Higher-Order Rewriting Applied to an HDL Semantics
A Rewrite Mechanism for Logic Programs with Negation
A Rewriting Technique for Implementing Active Object Systems
A Termination Ordering for Higher Order Rewrite Systems
Automatic Termination Proofs with Transformation Orderings
Compiling Rewriting onto SIMD and MIMD/SIMD Machines
Concurrent Garbage Collection for Concurrent Rewriting
Conventional and Uniqueness Typing in Graph Rewrite Systems
Generating Polynomial Orderings for Termination Proofs
Grobner Bases: Strategies and Applications
Guiding Term Reduction Through a Neural Network: Some Preliminary Results for the Group Theory
(Head-)Normalization of Typeable Rewrite Systems
Imperative Program Transformation by Rewriting
Implementation of Magic-sets in a Relational Database System
Improving Space, Time, and Termination in Rewriting-Based Programming
Infinitary Lambda Calculi and Bohm Models
Integrating Graph Rewriting and Standard Software Tools
Lazy Rewriting and Eager Machinery
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Local Action Systems and DPO Graph Transformation
Modularity of Completeness Revisited
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad
Prolog with Term Rewriting as a Functional Component
Prototyping Completion with Constraints Using Computational Systems
Relating Two Categorical Models of Term Rewriting
Rewriting Rule Methods in Logic Databases
Rewriting Techniques and Applications: Proc./12th Intern. Conf., RTA 2001, Utrecht, The Netherlands, May 2001
Rewriting Techniques and Applications: Proc./6th Intern. Conf., RTA-95. Kaiserslautern, Germany, April 1995
Some Independence Results for Equational Unification
Towards a Domain Theory for Termination Proofs