Equivalent transformations of recursive schemes with finite deconvolution

MaRDI QIDQ5930899zbMATH OpenFDO

Authors A. V. Sabel'fel'd, Viktor K. Sabelfeld

Publication date 6 November 2001

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

finite recursive schemes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• The tree equivalence of linear recursion schemes
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Some equivalent transformations of recursive programs based on their schematic properties
• Decidable subcases of the equivalence problem for recursive program schemes
• On the construction of complete systems of equivalent transformations of program schemes

Cited in

(2)

• The tree equivalence of linear recursion schemes
• Some equivalent transformations of recursive programs based on their schematic properties

This page was built for publication: Equivalent transformations of recursive schemes with finite deconvolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930899)