scientific article; zbMATH DE number 3631906
From MaRDI portal
Publication:4192941
Cited in
(10)- NTS languages are deterministic and congruential
- Derivation of efficient programs for computing sequences of actions
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Recursion induction principle revisited
- La fonction d'Ackermann : un nouveau mode de dérécursivation
- Infinite trees in normal form and recursive equations having a unique solution
- Proving the correctness of recursion-based automatic program transformations
- The McCarthy's recursion induction principle: oldy but goody
- Proving the correctness of recursion-based automatic program transformations
- Using circular programs to eliminate multiple traversals of data
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192941)
