An algebraic definition for control structures

DOI10.1016/0304-3975(80)90028-6zbMath0456.68015OpenAlexW1994285316MaRDI QIDQ1151016

Guy Cousineau

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90028-6

zbMATH Keywords

program transformationscontrol structures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Rational rewriting ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Étude et implémentation d'un système de déduction pour logique algorithmique ⋮ The solutions of two star-height problems for regular trees ⋮ Fundamental properties of infinite trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Translatability of flowcharts into while programs
• Analysis of structured programs
• Notes on avoiding ``go to statements
• Tree acceptors and some of their applications
• A Transformation System for Developing Recursive Programs
• Program Improvement by Source-to-Source Transformation
• On the capabilities of while, repeat, and exit statements
• Flow diagrams, turing machines and languages with only two formation rules
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: An algebraic definition for control structures