Program transformations and algebraic semantics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3705883 (Why is no real title available?)
- scientific article; zbMATH DE number 3485226 (Why is no real title available?)
- scientific article; zbMATH DE number 3513288 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 3566824 (Why is no real title available?)
- scientific article; zbMATH DE number 3567992 (Why is no real title available?)
- scientific article; zbMATH DE number 3567993 (Why is no real title available?)
- scientific article; zbMATH DE number 3628349 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3229496 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- Another recursion induction principle
- Correct Computation Rules for Recursive Languages
- Notes on avoiding ``go to statements
- On formalised computer programs
- On some classes of interpretations
- Solvable cases of the decision problem
- Translating recursion equations into flow charts
Cited in
(5)- Parameter-reduction of higher level grammars
- The evaluation of first-order substitution is monadic second-order compatible
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Fundamental properties of infinite trees
- Some equivalent transformations of recursive programs based on their schematic properties
This page was built for publication: Program transformations and algebraic semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254849)