Higher-order proof by consistency

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

Volumn 1180, Issue , 1996, Pages 274-285

  Linnestad, Henrik ^a   Prehofer, Christian ^b   Lysne, Olav ^a  

^a UNIVERSITY OF OSLO   (Norway)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL ANALYSIS;

FIRST ORDER METHOD; HIGHER-ORDER; PROOF PROCEDURES; REWRITE RULES; TERM REWRITING;

SOFTWARE ENGINEERING;

EID: 84947935361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_56     Document Type: Conference Paper

References (27)

1. L. Bachmair. Canonical Equational Proofs. Birkhäuser, 1991.
2. E. Bevers and J. Lewi. Proof by consistency in conditional equational theories. In Proc. 2nd International Workshop on Conditional and Typed Rewriting Systems, volume 516 of Led. Not. in Comp. Set., pages 194-205. Springer-Verlag, 1990.
3. V. Breazu-Tannen. Combining algebra and higher-order types. In Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh (UK), July 1988.
4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier, 1990.
5. L. Fribourg. A strong restriction on the inductive completion procedure. In Proc. 13th International Colloquium on Automata, Languages and Programming, volume 226 of Lect. Not. in Comp. Sci., pages 105-115. Springer-Verlag, 1986.
6. J. A. Goguen. How to prove inductive hypotheses without induction. In W. Bíbel and R. Kowalski, editors, Proc. of the 5th Conference on Automated Deduction, volume 87 of Lect. Not. in Comp. Sci., pages 356-373. Springer-Verlag, 1980.
7. M. J. C. Gordon. HOL: A proof generating system for higher-order logic. In G. Birtwistle et al., editor, VLSI Specification, Verification and Synthesis. Kluwer Academic Press, 1988.
8. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25(2):239-266, 1982.
9. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in equational theories without constructors. In Proc. Logic in Computer Science, pages 358-366, 1986.
10. J.-P. Jouannaud and A. Rubio. A recursive path ordering for higher-order terms in fj-long /3-normal form. In H. Ganzinger, editor, Proc. 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lect. Not. in Comp. Sci. Springer-Verlag, 1996.
11. S. Kahrs. Towards a domain theory for termination proofs. In Proc. of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lect. Not. in Comp. Sci., pages 241-255. Springer-Verlag, 1995.
12. D. Kapur, P. Narendran, and H. Zhang. On sufficient-completeness and related properties of term rewriting systems. Acta Informatica, 24(4):395-415, 1987.
13. J. W. Klop. Combinatory Reduction Systems. Mathematical Centre Tracts 127, Math-ematisch Centrum,Amsterdam, 1980.
14. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
15. C. A. Loría-Sáenz. A Theoretical Framework for Reasoning about Program Construction Based on Extensions of Rewrite Systems. PhD thesis, Universität Kaiserslautern, 1993.
16. O. Lysne. Proof by consistency in constructive systems with final algebra semantics. In Proc. 3rd International Conference on Algebraic and Logic Programming, Pisa (Italy), volume 632 of Lect. Not. in Comp. Sci., pages 276-290. Springer-Verlag, 1992.
17. O. Lysne. Extending Bachmair's method for proof by consistency to the final algebra. Information Processing Letters, 51:303-310, 1994.
18. O. Lysne and J. Piris. A termination ordering for higher order rewrite systems. In Proc. 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of Lect. Not. in Comp. Sci., pages 26-40. Springer-Verlag, 1995.
19. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Technical report, Institut für Informatik, Technische Universität München, August 1994. To appear in Theoretical Computer Science.
20. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In Extensions of Logic Programming, volume 475 of Lect. Not. in Comp. Sci., pages 253-281. Springer-Verlag, 1991.
21. D. L. Musser. On proving inductive properties in abstract data types. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 154-162, January 1980.
22. T. Nipkow. Higher-order critical pairs. In Proc. of the 6th IEEE Symposium on Logic in Computer Science, pages 342-359, 1991.
23. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Not. in Comp. Sci. Springer-Verlag, 1994.
24. C. Prehofer. Decidable higher-order unification problems. In Proc. 12th International Conference on Automated Deduction, Nancy, volume 814 of Lect. Not. in Art. Intell., pages 635-649. Springer-Verlag, 1994.
25. C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. PhD thesis, Technische Universität München, 1995.
26. U. S. Reddy. Term rewriting induction. In Proc. 10th International Conference on Automated Deduction, Kaiserslautern, volume 449 of Lect. Not. in Comp. Sci., pages 162-177. Springer-Verlag, 1990.
27. J. van de Pol. Termination proofs for higher-order rewrite systems. In 1st International Workshop on Higher-Order Algebra, Logic and Term Rewriting, volume 816 of Lecture Notes in Computer Science, pages 305-325. Springer-Verlag, 1993.