CoChat
Sign Up
Cited by 106Logic, programming, and type systemssemigroups and automata theoryAlgorithms and Data Compression

Occam's razor in metacomputation: the notion of a perfect process tree

Glück, Robert, Klimov, Andrei V.·1993·Lecture Notes in Computer Science
DOI 10.1007/3-540-57264-3_34
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/3-540-57264-3_34

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

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

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?

  • The generalization strategy in Sørensen and Glück [1995] uses ¢ to compare nodes in a marked partial process tree, a notion originating from Glück and Klimov [1993] and corresponding to global trees in partial deduction.

    “It uses ¢ to compare nodes in a marked partial process tree: a notion originating from Glück and Klimov • 241 [1993] and corresponding to global trees in partial deduction.”

    From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Glück and Klimov [1993]

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Abramov S. M., Metacomputation and program testing. In: 1st International Workshop on Automated and Algorithmic Debugging. (Linköping, Sweden). 121–135, Linköping University 1993.
  2. Glück R., Projections for knowledge based systems. In: Trappl R. (ed.), Cybernetics and Systems Research '92. Vol. 1, 535–542, World Scientific: Singapore 1992.
  3. Jones N. D., Automatic program specialization: a re-examination from basic principles. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel AvernÆs, Denmark). 225–282, North-Holland 1988.
  4. Klimov And. V. Klimov, Romanenko S. A., A metaevaluator for the language Refal. Basic concepts and examples. Keldysh Institute of Applied Mathematics, Academy of Sciences of the USSR, Moscow. Preprint No. 71, 1987 (in Russian).
  5. Mogensen T. Æ., Partially static structures in a self-applicable partial evaluator. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel AvernÆs, Denmark). 325–347, North-Holland 1988.
  6. Romanenko S. A., Driving for Refal-4 programs. Keldysh Institute of Applied Mathematics, Academy of Sciences of the USSR, Moscow. Preprint No. 211, 1987 (in Russian).
  7. Turchin V. F., Equivalent transformations of recursive functions defined in Refal. In: Teoria Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods). (Kiev-Alushta, USSR). 31–42, 1972 (in Russian).
  8. Turchin V. F., Equivalent transformations of Refal programs. In: Avtomatizirovannaja Sistema upravlenija stroitel'stvom. Trudy CNIPIASS, 6: 36–68, 1974 (in Russian).
  9. Turchin V. F., The algorithm of generalization in the supercompiler. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gl. AvernÆs, Denmark). 341–353, 1988.

Cited by

Sorted by citations

Related

Authors
Glück, R., & Klimov, A. V.
Affiliations
  • TU Wien (AT)
  • Russian Academy of Sciences (RU)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
1993
Pages
112-123
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/3-540-57264-3_34
OpenAlex
W2162352259
Cited by
106
References
19
Citations by year
2020: 1 · 2018: 1 · 2016: 1 · 2015: 1 · 2013: 2 · 2012: 1
FWCI
8.93
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • Research at the University of Copenhagen (University of Copenhagen) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
Keywords
supercompilation, constant propagation, pattern matching, Knuth-Morris-Pratt algorithm, program specialization, program transformation

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