Linear second-order unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 332-346

  Levy, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BOUND VARIABLES; CONTEXT UNIFICATIONS; FREE VARIABLE; LAMBDA ABSTRACTION; LINEAR TERMS; SECOND ORDERS; SOUND AND COMPLETE; UNIFICATION PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 84957670463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_63     Document Type: Conference Paper

References (18)

1. H. Comon. Completion of rewrite systems with membership constraints, part I: Deduction rules and part II: Constraint solving. Technical report, CNRS and ŁRI, Université de Paris Sud, 1993. (To appear in J. of Symbolic Computation).
2. J. H. Gallier and W. Snyder. Designing unification procedures using transformations: A survey. Bulletin of the EATCS, 40:273-326, 1990.
3. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
4. W. E. Gould. A Matching Procedure for ω-Order Logic. PhD thesis, Princeton Univ., 1966.
5. G. Huet. The undecidability of unification in third-order logic. Information and Control, 22(3):257-267, 1973.
6. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
7. D. C. Jensen and T. Pietrzykowski. Mechanizing ω-order type theory through unification. Theoretical Computer Science, 3:123-171, 1976.
8. J. Levy and J. Agustí. Bi-rewriting, a term rewriting technique for monotonic order relations. In 4th Int. Conf. on Rewriting Techniques and Applications, RTA '93, volume 690 of LNCS, pages 17-31, Montreal, Canada, 1993.
9. J. Levy and J. Agustí. Bi-rewriting systems. J. of Symbolic Computation, 1995. (To be published).
10. C. Loría-Sáenz. A Theoretical Framework for Reasoning about Program Construction based on Extensions of Rewrite Systems. PhD thesis, Univ. Kaiserslautern, 1993.
11. C. L. Lucchesi. The undecidability of the unification problem for third-order languages. Technical Report CSRR 2059, Dept, of Applied Analysis and Computer Science, Univ. of Waterloo, 1972.
12. O. Lysne and J. Piris. A termination ordering for higher-order rewrite systems. In 6th Int. Conf on Rewriting Techniques and Applications, RTA '95, volume 914 of LNCS, Kaiserslautern, Germany, 1995.
13. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. of Logic and Computation, 1:497-536, 1991.
14. T. Nipkow. Functional unification of higher-order patterns. In 8th IEEE Symp. on Logic in Computer Science, LICS'93, pages 64-74, Montreal, Canada, 1993.
15. T. Pietrzykowski. A complete mechanization of second-order logic. J. of the ACM, 20(2):333-364, 1973.
16. C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. PhD thesis, Technische Universitãt München, 1995.
17. M. Schmidt-Schauß. Unification of stratified second-order terms. Technical Report 12/94, Johan Wolfgang-Goethe-Universität, Frankfurt, Germany, 1995.
18. K. U. Schulz. Makanin's algorithm, two improvements and a generalization. Technical Report CIS-Bericht-91-39, Centrum für Informations und Sprachverarbeitung, Universität München, 1991.