An algebraic definition for control structures
From MaRDI portal
Cites work
- A Transformation System for Developing Recursive Programs
- Analysis of structured programs
- Flow diagrams, turing machines and languages with only two formation rules
- scientific article; zbMATH DE number 3705883 (Why is no real title available?)
- scientific article; zbMATH DE number 3456484 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3430635 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- scientific article; zbMATH DE number 3421895 (Why is no real title available?)
- Notes on avoiding ``go to statements
- On the capabilities of while, repeat, and exit statements
- Program Improvement by Source-to-Source Transformation
- Translatability of flowcharts into while programs
- Tree acceptors and some of their applications
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(8)- Fundamental properties of infinite trees
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Étude et implémentation d'un système de déduction pour logique algorithmique
- scientific article; zbMATH DE number 3688675 (Why is no real title available?)
- scientific article; zbMATH DE number 3631912 (Why is no real title available?)
- Rational rewriting
- Checking equivalence of corecursive streams: an inductive procedure
- The solutions of two star-height problems for regular trees
This page was built for publication: An algebraic definition for control structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151016)
