pith. sign in

arxiv: 0707.1059 · v1 · submitted 2007-07-06 · 💻 cs.PL

Projection semantics for rigid loops

classification 💻 cs.PL
keywords rigidadequacylooploopsprogramsemanticaccessiblealgebra
0
0 comments X
read the original abstract

A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax of the program algebra PGA. Two different semantic projections are provided and proven equivalent. One of these is taken to have definitional status on the basis of two criteria: `normative semantic adequacy' and `indicative algorithmic adequacy'.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.