CoChat
Sign Up
Cited by 34Logic, programming, and type systemsFormal Methods in VerificationSoftware Testing and Debugging Techniques

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

Regular approximation of computation paths in logic and functional languages

Gallagher, John, Lafave, Laura·1996·Lecture Notes in Computer Science
DOI 10.1007/3-540-61580-6_7
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/3-540-61580-6_7

Cites

1 of 1 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?

  • A similar effect to normalization can be obtained, in the context of definite programs, via the trace terms of Gallagher and Lafave [1996].

    “A similar effect can be obtained, in the context of definite programs, via the trace terms of Gallagher and Lafave [1996].”

    From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Gallagher and Lafave [1996]

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 22

  1. M. Bruynooghe and G. Janssens. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2&3):205–258, 1992.
  2. D.A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, 1994. · DOI
  3. T. Frühwirth, E. Shapiro, M.Y. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991. · DOI
  4. J. Gallagher. Transforming logic programs by specialising interpreters. In Proceedings of the 7th European Conference on Artificial Intelligence (ECAI-86), Brighton, pages 109–122, 1986.
  5. J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(1991):305–333, 1991. · DOI · Paper page
  6. J. Gallagher and D.A. de Waal. Fast and precise regular approximation of logic programs. In P. Van Hentenryck, editor, Proceedings of the International Conference on Logic Programming (ICLP'94), Santa Margherita Ligure, Italy, MIT Press, 1994.
  7. Robert Glück and Morten Heine Sørensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming, pages 165–181, Springer-Verlag, 1994. · DOI
  8. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. Journal of Logic Programming, (to appear).
  9. N. Heintze. Practical aspects of set based analysis. In K. Apt, editor, Proceedings of the Joint International Symposium and Conference on Logic Programming, pages 765–769, MIT Press, 1992.
  10. N. Jones and A. Mycroft. Dataflow analysis of applicative programs using minimal function graphs. In Proceedings of Principle of Programming Languages (POPL'86), ACM Press, 1986. · DOI
  11. M. Leuschel. Ecological partial deduction: preserving characteristic trees without constraints. In M. Proietti, editor, Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, Springer-Verlag (to appear), 1995. · DOI
  12. M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Glück, and P. Thiemann, editors, Proc. of the Dagstuhl Seminar on Partial Evaluation, Springer-Verlag, 1996. · DOI
  13. B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proc. International Conference on Logic Progrmaming, (ICLP'95), Tokyo, MIT Press, 1995.
  14. H. Saglam and J. Gallagher. Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions. Technical Report CSTR-95-17, University of Bristol, Department of Computer Science, 1995. · DOI
  15. Morten Heine Sørensen and Robert Glück. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, International Logic Programming Symposium, page to appear, MIT Press, 1995.
  16. Morten Heine Sørensen, Robert Glück, and Neil D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In ESOP, Springer-Verlag, 1994. · DOI
  17. E.Y. Shapiro. Or-parallel prolog in flat concurrent prolog. In E.Y. Shapiro, editor, Concurrent Prolog: Collected Papers (Volume 2), MIT Press, 1987.
  18. H. Tamaki and T. Sato. OLDT resolution with tabulation. In E.Y. Shapiro, editor, Proc. 3rd ICLP, London, Springer-Verlag, 1986.
  19. V. Turchin. The algorithm of generalization in the supercompiler. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Proc. of the IFIP TC2 Workshop, Partial Evaluation and Mixed Computation, pages 531–549, North-Holland, 1988.
  20. V. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283–313, 1993. · DOI
  21. V. Turchin. Metacomputation: MST plus SCP. In O. Danvy, R. Glück, and P. Thiemann, editors, Proc. of the Dagstuhl Seminar on Partial Evaluation, Springer-Verlag, 1996.
  22. E. Yardeni and E.Y. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125–154, 1990. · DOI

Cited by

Sorted by citations

Metadata

Authors
Gallagher, J., & Lafave, L.
Affiliations
University of Bristol (GB)
ORCID
Gallagher, John
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
1996
Pages
115-136
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/3-540-61580-6_7
OpenAlex
W1492471923
Cited by
34
References
1
Citations by year
2021: 1 · 2019: 1 · 2018: 3 · 2016: 2 · 2015: 3 · 2014: 2
FWCI
3.42
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • Bristol Research (University of Bristol) (submittedVersion)
  • Explore Bristol Research (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
Keywords
regular approximation, computation trees, logic programming, functional programming, program specialization, control flow analysis, determinacy, branching structures

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