Iteration and labelled iteration

Bram Geron, Paul Levy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)
178 Downloads (Pure)

Abstract

We analyse the conventional sum-based representation of iteration from the perspective of programmers, and show that the syntax they suggest is fundamentally not a good representation of Java-style iteration with for, while, break, and continue. We present an alternative syntax, which we call “labelled iteration”, where loops are identified using labels. The languages are analysed: we give denotational and operational semantics, adequacy proofs for both languages, and a translation function from sum-based iteration to labelled iteration.
Original languageEnglish
Title of host publicationProceedings of Mathematical Foundations of Programming Semantics XXXII, (MFPS 2016)
PublisherElsevier
Pages127-146
Number of pages20
DOIs
Publication statusPublished - 5 Oct 2016
Event32nd Conference on the Mathematical Foundations of Programming Semantics(MFPS XXXII) -
Duration: 23 May 201626 May 2016

Publication series

NameElectronic Notes in Theoretical Computer Science
PublisherElsevier
Volume325
ISSN (Print)1571-0661

Conference

Conference32nd Conference on the Mathematical Foundations of Programming Semantics(MFPS XXXII)
Period23/05/1626/05/16

Fingerprint

Dive into the research topics of 'Iteration and labelled iteration'. Together they form a unique fingerprint.

Cite this