Program transformations and algebraic semantics

DOI10.1016/0304-3975(79)90005-7zbMath0399.68023OpenAlexW1981599076MaRDI QIDQ1254849

Irène Guessarian

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90005-7

zbMATH Keywords

Algebraic SemanticsEquivalences of Recursive Program SchemesProgram Transformations

Mathematics Subject Classification ID

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

Related Items (5)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Parameter-reduction of higher level grammars ⋮ Fundamental properties of infinite trees ⋮ Some equivalent transformations of recursive programs based on their schematic properties ⋮ The evaluation of first-order substitution is monadic second-order compatible

Uses Software

• LCF

Cites Work

• On some classes of interpretations
• Notes on avoiding ``go to statements
• On formalised computer programs
• Translating recursion equations into flow charts
• Solvable cases of the decision problem
• A Transformation System for Developing Recursive Programs
• Correct Computation Rules for Recursive Languages
• Another recursion induction principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Program transformations and algebraic semantics