Cited by 40Logic, programming, and type systemsParallel Computing and Optimization TechniquesMathematical and Computational Methods

PUFFT—The Purdue University fast FORTRAN translator

Open access
Rosen, Saul, Spurgeon, Robert A., Donnelly, Joel K.·1965·Communications of the ACM

Abstract

1) (cos ~,-1 x) + sin :c cos '~-~ :c' e handles only those eases in which n is both positive

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/365660.365671

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Researchers and instructors have reported programming error messages to be difficult for students since at least 1965.

    “Researchers and instructors have reported PEMs to be difficult for students since at least 1965 [35].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Rosen, S., Spurgeon, R. A., & Donnelly, J. K.
Affiliations
Purdue University West Lafayette (US)
Venue
Communications of the ACM
Published
1965-11
Volume
8
Issue
11
Pages
661-666
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W1965093370
Cited by
40
References
5
Citations by year
2025: 2 · 2024: 2 · 2023: 2 · 2021: 4 · 2019: 1 · 2015: 1 · 2012: 1
FWCI
6.24
Type
journal article
Language
en
Open access
Locations
Communications of the ACM (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Mathematics › Modeling and Simulation › Mathematical and Computational Methods
Keywords
compilers, Purdue University, source-to-source translation, trigonometric identities

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