A difference in expressive power between flowcharts and recursion schemes
From MaRDI portal
Publication:3860819
DOI10.1007/BF01776573zbMath0425.68020MaRDI QIDQ3860819
Edward K. Blum, Nancy A. Lynch
Publication date: 1979
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (6)
Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) ⋮ Straight-line program length as a parameter for complexity analysis ⋮ A difference in complexity between recursion and tail recursion ⋮ Relative complexity of operations on numeric and bit-string algebras ⋮ Relative complexity of algebras ⋮ Necessary and sufficient conditions for the universality of programming formalisms
Cites Work
This page was built for publication: A difference in expressive power between flowcharts and recursion schemes
