CoChat
Sign Up
Cited by 40Logic, programming, and type systemsModel-Driven Software Engineering TechniquesAdvanced Database Systems and Queries

The DOI matches its Crossref record.

Semantics preserving transformation rules for Prolog

Proietti, Maurizio, Pettorossi, Alberto·1991·Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '91
DOI 10.1145/115865.115895
Open this paper in CoChat — free account

Abstract

article Semantics preserving transformation rules for Prolog Share on Authors: Maurizio Proietti IASI-CNR, Viale Manzoni 30, 00185 Roma, Italy IASI-CNR, Viale Manzoni 30, 00185 Roma, ItalyView Profile , Alberto Pettorossi Electronics Department, University of Rome II, 00173 Roma, Italy Electronics Department, University of Rome II, 00173 Roma, ItalyView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 26Issue 9Sept. 1991 pp 274–284https://doi.org/10.1145/115866.115895Online:01 May 1991Publication History 25citation375DownloadsMetricsTotal Citations25Total Downloads375Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Overview

Integrity signals

Registry

Crossref · 10.1145/115865.115895

Cites

Statistics

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

Verification

Claims the paper makes

This paper’s full text isn’t openly available, 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 straightforward denotational semantics can be given to ITE-Prolog.

    “However, the semantics of the if-then-else remains reasonably simple and a straightforward denotational semantics [38], in the style of [4,79], can be given to ITE-Prolog.”

    From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [79]

  • In the context of unfold/fold transformations of pure logic programs, preservation of the order of solutions, as well as left-termination, is handled in [79,7].

    “In the context of unfold/fold transformations of pure logic programs, preservation of the order of solutions, as well as left-termination, is handled, e.g., in [79,7].”

    From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [79]

Citations

Cited by

Sorted by citations

Metadata

Authors
Proietti, M., & Pettorossi, A.
Affiliations
  • Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti (IT)
  • University of Rome Tor Vergata (IT)
ORCID
Venue
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '91
Publisher
ACM Press
Published
1991
Pages
274-284
DOI
10.1145/115865.115895
OpenAlex
W2113991923
Cited by
40
References
0
Citations by year
2016: 1
FWCI
5.50
Type
conference paper
Language
en
Open access
closed
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)
Locations
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
  • Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
Keywords
Prolog, semantic preservation, program transformation, transformation rules, logic programming, program optimization

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