A system which automatically improves programs
From MaRDI portal
Publication:1224418
DOI10.1007/BF00263742zbMath0323.68008OpenAlexW2038862832MaRDI QIDQ1224418
John Darlington, Rod M. Burstall
Publication date: 1976
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263742
Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (15)
An axiomatic approach to the Korenjak-Hopcroft algorithms ⋮ Unnamed Item ⋮ La fonction d'Ackermann : un nouveau mode de dérécursivation ⋮ A matching process modulo a theory of categorical products ⋮ Mixed computation: potential applications and problems for study ⋮ Unnamed Item ⋮ A case study in program transformation ⋮ Stack and locally finite transformations on structures with reversible transitions ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Efficient memo-table management strategies ⋮ Output driven interpretation of recursive programs, or writing creates and destroys data structures ⋮ Program transformation by solving equations ⋮ Synthetic programming ⋮ Extraction and verification of programs by analysis of formal proofs ⋮ Total unfolding: theory and applications
This page was built for publication: A system which automatically improves programs
