Some equivalent transformations of recursive programs based on their schematic properties
From MaRDI portal
Publication:794422
DOI10.1016/0020-0190(84)90007-3zbMATH Open0541.68004OpenAlexW2018564246MaRDI QIDQ794422FDOQ794422
Authors: Mark B. Trakhtenbrot 
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90007-3
Recommendations
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- scientific article; zbMATH DE number 3963179
- scientific article; zbMATH DE number 1614686
- How powerful are folding/unfolding transformations?
- Equivalent transformations of recursive schemes with finite deconvolution
Cites Work
- A Transformation System for Developing Recursive Programs
- A synthesis of several sorting algorithms
- On Classes of Program Schemata
- Inductive methods for proving properties of programs
- Tree equivalence of linear recursive schemata is polynomial-time decidable
- Program equivalence and context-free grammars
- Program transformations and algebraic semantics
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Equivalent transformations of program schemes for ``Entangling programs
- Title not available (Why is that?)
- Equivalent transformations of recursive schemes with finite deconvolution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Some equivalent transformations of recursive programs based on their schematic properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794422)
