The applicability of logic program analysis and transformation to theorem proving-Reference-Cited by-同舟云学术

The applicability of logic program analysis and transformation to theorem proving

Published:1994 Issue: Volume: Page:207-221
ISSN:0302-9743
Container-title:Automated Deduction — CADE-12
language:
Short-container-title:

Author:

Waal D. A.,Gallagher J. P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58156-1_15.pdf

Reference30 articles.

1. D.A. de Waal. The power of partial evaluation. In Y. Deville, editor, Logic Program Synthesis and Transformation, Louvain-la-Neuve 1993, Workshops in Computing, pages 113–123. Springer-Verlag, 1994.

2. D.A. de Waal and J. Gallagher. Logic program specialisation with deletion of useless clauses. In D. Miller, editor, Proceedings of the 1993 International Symposium, Vancouver, 1993.

3. D.A. de Waal and J.P. Gallagher. The applicability of logic program analysis and transformation to theorem proving. Technical Report CSTR-93-15, University of Bristol, September 1993.

4. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In 6th IEEE Symposium on Logic in Computer Science, Amsterdam, 1991.

5. Y. Futamura. Partial evaluation of computation process — an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45–50, 1971.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symbolic Specialization of Rewriting Logic Theories with Presto;Theory and Practice of Logic Programming;2022-02-11

2. Polyvariant Program Specialisation with Property-based Abstraction;Electronic Proceedings in Theoretical Computer Science;2019-08-20

3. A framework for the integration of partial evaluation and abstract interpretation of logic programs;ACM Transactions on Programming Languages and Systems;2004-05

4. Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking;Logic Based Program Synthesis and Transformation;2002

5. Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs;Practical Aspects of Declarative Languages;2001-12-20