On the power of recursion in dataflow schemes

DOI10.1007/3-540-62064-8_15MaRDI QIDQ6570932zbMATH OpenFDO

Authors Peter Bachmann

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-62064-8_15

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 4052989
• scientific article; zbMATH DE number 3872641
• scientific article; zbMATH DE number 3963179
• Higher order dataflow schemas
• scientific article; zbMATH DE number 2087767

Cites work

• scientific article; zbMATH DE number 3692619 (Why is no real title available?)
• scientific article; zbMATH DE number 3493844 (Why is no real title available?)
• Parallel Program Schemata and Maximal Parallelism II: Construction of Closures
• Theory of program structures: Schemes, semantics, verification

This page was built for publication: On the power of recursion in dataflow schemes

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