Вы здесь

Главная

терм

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

A Demand Driven Computation Strategy for Lazy Narrowing
A Direct Semantic Characterization of RELFUN
A Lattice of Abstract Graphs
Analogical Type Theory
Analyses of Inconsistency for Incremental Equational Logic Programming
A Note on Guarded Recursion
A Novel Term Compression Scheme and Data Representation in the BinWAM
A Sequential Reduction Strategy
Avoiding Dynamic Delays in Functional Logic Programs
Compilation of Compound Terms in Prolog
Completeness of Hierarchical Combinations of Term Rewriting Systems
Compositional Analysis for Equational Horn Programs
Conditional Narrowing with Constructive Negation
Conventional and Uniqueness Typing in Graph Rewrite Systems
Description Logics with Inverse Roles, Functional Restrictions, and N-ary Relations
Dynamic Dependence in Term Rewriting Systems and its Application to Program Slicing
Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning
Equational Reasoning with 2-dimensional Diagrams
Equivalent Transformations of Recursion Schemes and Admissible Rewriting Rule Systems
Experiences from Application of a Faceted Classification Scheme
From Paramodulation to Narrowing
Higher-Order and Semantic Unification
How to Realize LSE Narrowing
Kleene s Slash and Existence of Values of Open Terms in Type Theory
Local Equational Logic
Logic Programming with Functions over Order-Sorted Feature Terms
Logic Programs as Term Rewriting Systems
Narrowing Approximations as an Optimization for Equational Logic Programs
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
On Tree Pattern Unification Problems
Order-Sorted Feature Theory Unification
Parallelizing Functional Programs by Term Rewriting
Pattern Languages: Problems of Decidability and Generation
Pattern Matching in Order-Sorted Languages
Proving Termination of (Conditional) Rewrite Systems
Proving Termination of Logic Programs by Transforming Them into Equivalent Term Rewriting Systems
Retrieving Terms and their Variants in a Lexicalized Unification-Based Framework
Rewriting Logic and Its Applications: Revised Selected Papers/10th International Workshop, WRLA 2014 Held as Satellite Event of ETAPS, Grenoble, France, April 2014
Sufficient Completeness and Parametrized Proofs by Induction
Syntactical Analysis of Total Termination
Term Indexing
The Mathematics of Set Predicates in Prolog
The Rewrite Approach to Combined Logic and Functional Programming
Анализ некоторых семантических свойств программ аппликативного языка AL
Компьютерная реализация устранения избыточных правил в условных системах переписывания
Методы и средства статического анализа семантических свойств программ
Модель декларативных продукций с обоб енными операциями
О взаимодействиях систем переписывания термов и регулярных языков деревьев
Один метод реализации интерпретатора аппликативного языка программирования