Katherine Anne Yelick  Home/Search
Context Related
| mit.edu/publicatio...MITLCSTR344.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/publications/pubs/pdf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: equational unification problem is to find a uniform replacement of terms for the variables that makes the terms provably equal from the axioms. In the variable-only case, the two terms contain only variables and function symbols from the axioms. In the general case, the terms may contain symbols not appearing in the axioms, there may be more than one instance of a set of axioms, and there may be more than one set of axioms. (Update)
Context of citations to this paper: More
...programming languages. One program, AC Unify, computes the unifying substitutions for terms containing associative commutative operators [22]. It is 8,000 lines of commented CLU code. The other program, SIM, simulates an object oriented database [7] and is 7,000 lines of...
...true. Only then can the original term be reduced. 6.2. 2 Operator Theories Operator theories enhance term rewriting by generalizing matching [54]. Each function symbol has an operator theory. The three operator theories handled by LP are: empty, commutative, and...
Cited by: More
Exploiting Specifications to Improve Program Performance - Vandevoorde (1994) (Correct)
Planning for Behaviour-Based Robotic Assembly: A Logical Framework - Cranefield (1990) (Correct)
Using Specialized Procedures and Specification-Based.. - Vandevoorde, Guttag (1994) (Correct)
Active bibliography (related documents): More All
1.6: A Framework for Incorporating Abstraction Mechanisms into the.. - Zachary (1987) (Correct)
0.6: Semantic Unification for Convergent Systems - Mitra (1994) (Correct)
0.5: Combining Logic Programming and Equation Solving - Hölldobler (Correct)
Similar documents based on text: More All
2.3: Knowledge Based Simulation: An Artificial.. - Fox, Husain.. (1988) (Correct)
0.5: Specification Tuning of System-Level Design - Cai, Gajski (2002) (Correct)
0.3: The Driving Pipeline: - Driving Control Scheme (1988) (Correct)
Related documents from co-citation: More All
3: An axiomatic basis for computer programming (context) - Hoare - 1969
2: Larch: Languages and tools for formal specification (context) - Guttag, Horning et al. - 1993
2: A fresh look at optimizing array bounds checking (context) - Gupta - 1990
BibTeX entry: (Update)
K. Yelick. A generalized approach to equational unification. Technical Report MIT/LCS/TR-344, M.I.T., August 1985. http://citeseer.ist.psu.edu/yelick85generalized.html More
@techreport{ yelick85generalized,
author = "K. A. Yelick",
title = "A {GENERALIZED} {APPROACH} {TO} {EQUATIONAL} {UNIFICATION}",
number = "MIT/LCS/TR-344",
pages = "102",
year = "1985",
url = "citeseer.ist.psu.edu/yelick85generalized.html" }
Citations (may not include all citations):4212 Computers and Intractability; A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
634 A Machine-Oriented Logic Based on the Resolution Principle (context) - Robinson - 1965
384 Simple Word Problems in Universal Algebras (context) - Knuth, Bendix - 1970
247 Confluent Reductions: Abstract Properties and Applications t.. (context) - Huet - 1980
159 Predicate Logic as a Programming Language (context) - Kowalski - 1974
154 Simplification by Cooperating Decision Procedures (context) - Nelson, ppen - 1979
126 Canonical Forms and Unification (context) - Hullot - 1980
121 Deciding Combinations of Theories (context) - Shostak - 1984
114 Building-in Equational Theories (context) - Plotkin - 1972
105 The Problem of Solvability of Equations in a Free Semigroup (context) - Makanin - 1977
103 Complete Sets of Reductions for Some Equational Theories (context) - Peterson, Stickel - 1981
87 An Efficient Unification Algorithm (context) - Martelli, Montanari - 1982
74 the Structure of Abstract Algebras (context) - Birkhoff - 1935
68 Proofs by Induction in Equational Theories with Constructors (context) - Huet, Hullot - 1982
65 Automated Theorem-Proving for Theories with Simplifiers, Com.. (context) - Slagle - 1974
65 Universal Algebra (context) - Cohn - 1965
62 A Unification Algorithm for Associative-Commutative Theories (context) - Stickel - 1975
55 Completion of a Set of Rules Modulo a Set of Equations (context) - Jouannaud, Kirchner - 1984
54 First-order Unification in an Equational Theory (context) - Fay - 1979
51 Linear Unification (context) - Paterson, Wegman - 1978
51 the Sequential Nature of Unification (context) - Dwork, Kanellakis et al. - 1984
45 Proof by Consistency (context) - Kapur, Musser - 1984
39 Complexity of Matching Problems (context) - Benanav, Kapur et al. - 1985
27 Hilbert's Tenth Problem is Unsolvable (context) - Davis - 1973
25 Computing with Rewrite Systems (context) - Dershowitz - 1983
23 An Introduction to OBJ: A Language for Writing and Testing F.. (context) - Goguen, Tardo - 1979
23 Associative-Commutative Unification (context) - Fages - 1984
22 Computational Logic: The Unification Computation (context) - Robinson - 1971
20 Lecture Notes in Computer Science (context) - Liskov, Atkinson et al. - 1981
19 Computer Experiments with the REVE Term Rewriting System Gen.. (context) - Lescanne - 1983
17 Equations and Rewrite Rules: A Survey (context) - Huet, Oppen - 1980
17 Narrower, a New Algorithm for Unification and its Applicatio.. (context) - Rbty, Kirchner et al. - 1985
16 Complete Sets of Unifiers and Matchers in Equational Theorie.. (context) - Fages, Huet - 1983
16 AssociativeCommutative Rewriting (context) - Dershowitz, Josephson et al. - 1983
16 A Rehabilitation of Robinson's Unification Algorithm (context) - Corbin, Bidoit - 1983
15 Universal Unification (context) - Siekmann - 1984
15 How to Prove Algebraic Inductive Hypotheses Without Inductio.. (context) - Goguen - 1980
13 Oriented Equational Clauses as a Programming Language (context) - Fribourg - 1984
13 A Prolog Interpreter Working with Infinite Terms (context) - Filgueiras - 1982
11 Topics in Automated Theorem Proving and Program Generation (context) - Hsiang - 1982
9 private communication (context) - Kapur - 1985
5 A Theory of Polymorphism in Programming (context) - Milner - 1978
5 A New Equational Unification Method: A Generalisation of Mar.. (context) - Kirchner - 1984
5 Incremental Construction of Unification Algorithms in Equati.. (context) - Jouannaud, Kirchner et al. - 1983
5 A Program for Generating and Analyzing Term Rewriting System.. (context) - Forgaard - 1984
4 Preliminary Report on The Larch Shared Language - Guttag, Horning - 1983
4 Unification of Commutative Terms (context) - Siekmann - 1979
4 REVE: A Term Rewriting System Generator with Failure-Resista.. (context) - Forgaard, Guttag - 1984
3 Coercion and Type Inference (Summary (context) - Mitchell - 1984
3 Deciding Unique Termination of Permutative Rewrite Systems: .. (context) - Jeanrond - 1980
2 Unification Problems with One-Sided Distributivity (context) - Arnborg, Tidbn - 1985
2 An Efficient Unification Algorithm (context) - Baxter - 1973
1 Unification of A + C Terms (Bags) and A + C + I Terms (Sets (context) - Livesey, Siekmann - 1976
1 AbelJan Group Unification Algorithms for Elementary Terms (context) - Lankford, Butler et al. - 1984
1 Semantic Checking of Formal Specifications (context) - Kownacki - 1984
1 Methodes et Outils de Conception Systmatique D'Algorithmes D.. (context) - Kirchner, Ki - 1985
1 Formes Canoniques dans les Algebres Booleennes, et Applicati.. (context) - Fages - 1983
1 private communication (context) - Kirchner, Kirchner - 1984
1 Springer-Verlag Berlin Heidelberg New York (context) - Clocksin, Mellish et al. - 1981
1 Solving Equations in the Signed Trees Theory (context) - Kirchner, Kirchner - 1981
1 The Undecidability of the D+ A-Unification Problem (context) - SzabO - 1978
1 private communication (context) - Tidbn - 1985
1 Morphismenunifikation (context) - Vogel - 1978
1 Unification of Idempotent Functions (context) - Raulefs, Siekmann - 1978
1 Retrireve: Proving Petri Net Properties with Rewriting Syste.. (context) - Choppy, Johnen - 1985
1 private communication (context) - Fages - 1985
1 private communication (context) - Chandra, Kanellakis - 1984
1 Springer-Verlag (context) - Grtzer - 1969
1 Two Applications of Equational Theories to Data Base Theory (context) - Cosmadakis, Kanellakis - 1985
1 An Ideal.Theoretic Approach to Word Problems and Unification.. (context) - Kandri-Rody, Kapur et al. - 1985
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/pdf/): More
Proving Correctness of a Distributed Shared Memory Implementation - Castro (1999) (Correct)
Experience with Fine-Grain Synchronization in MIMD Machines.. - Yeung, Agarwal (1993) (Correct)
Write Barrier Removal by Static Analysis - Zee, Rinard (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC