CoChat
Sign Up
Cited by 12Logic, programming, and type systemsLogic, Reasoning, and KnowledgeAdvanced Database Systems and Queries

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Sonic Partial Deduction

Martin, Jonathan, Leuschel, Michael·2000·Lecture Notes in Computer Science
DOI 10.1007/3-540-46562-6_9
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/3-540-46562-6_9

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 23

  1. M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction of logic programs. In Proceedings of ILPS’91, pages 117–131. MIT Press, 1991.
  2. M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47–79, 1992. · DOI · Paper page
  3. M. Bruynooghe, M. Leuschel, and K. Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In C. Hankin, editor, Proceedings of ESOP’98, LNCS 1381, pages 27–41. Springer-Verlag, April 1998. · DOI
  4. D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. The Journal of Logic Programming, 19 & 20:199–260, May 1994. · DOI
  5. D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, and M. H. Sørensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. The Journal of Logic Programming, 41(2 & 3):231–277, 1999. · DOI · Paper page
  6. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–116, 1987. · DOI
  7. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476, 1979. · DOI
  8. A. Ershov. On Futamura projections. BIT (Japan), 12(14):4–5, 1982. In Japanese.
  9. J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings of PEPM’93, pages 88–98. ACM Press, 1993. · DOI · Paper page
  10. R. Glück, J. Jørgensen, B. Martens, and M. H. Sørensen. Controlling conjunctive partial deduction of definite logic programs. In H. Kuchen and S. Swierstra, editors, Proceedings of PLILP’96, LNCS 1140, pages 152–166, Aachen, Germany, September 1996. Springer-Verlag. · DOI
  11. C. A. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, Dept. of Computer Science, University of Bristol, 1994.
  12. M. Leuschel. Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U. Leuven, May 1997. Accessible via http://www.ecs.soton.ac.uk/~mal .
  13. M. Leuschel. Improving homeomorphic embedding for online termination. In P. Flener, editor, Proceedings of LOPSTR’98, LNCS 1559, pages 199–218, Manchester, UK, June 1998. Springer-Verlag.
  14. M. Leuschel. On the power of homeomorphic embedding for online termination. In G. Levi, editor, Proceedings of SAS’98, LNCS 1503, pages 230–245, Pisa, Italy, September 1998. Springer-Verlag. · DOI
  15. M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor, Proceedings of JICSLP’96, pages 319–332, Bonn, Germany, September 1996. MIT Press.
  16. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. · DOI
  17. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3& 4):217–242, 1991. · DOI · Paper page
  18. B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 28(2):89–146, 1996. · DOI · Paper page
  19. B. Martens, D. De Schreye, and T. Horváth. Sound and complete partial deduction with unfolding based on well-founded measures. Theoretical Comput. Sci., 122(12):97–117, 1994. · DOI · Paper page
  20. J. Martin and A. King. Generating Efficient, Terminating Logic Programs. In TAPSOFT’97. Springer-Verlag, 1997. · DOI
  21. T. Mogensen and A. Bondorf. Logimix: A self-applicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Proceedings of LOPSTR’92, pages 214–227. Springer-Verlag, 1992. · DOI
  22. S. A. Romanenko. A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 445–463. North-Holland, 1988.
  23. M. H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Proceedings of ILPS’95, pages 465–479, Portland, USA, December 1995. MIT Press.

Cited by

Sorted by citations

Metadata

Authors
Martin, J., & Leuschel, M.
Affiliations
University of Southampton (GB)
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2000
Pages
101-112
ISSN
0302-9743 (ISSN-L)
DOI
10.1007/3-540-46562-6_9
OpenAlex
W1910609394
Cited by
12
References
2
FWCI
2.25
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • ePrints Soton (University of Southampton) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
Keywords
partial deduction, logic programming, program specialization, compiler generators

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review