Output driven interpretation of recursive programs, or writing creates and destroys data structures

DOI10.1016/0020-0190(76)90010-7zbMath0359.68024OpenAlexW2057864400MaRDI QIDQ1238624

David S. Wise, Daniel P. Friedman

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90010-7

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01)

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pascal. User manual and report. 2nd ed
• A system which automatically improves programs
• Scheme: A interpreter for extended lambda calculus
• Characterization of flowchartable recursions
• A method for overlapping and erasure of lists
• Boolean-valued loops
• Correspondence between ALGOL 60 and Church's Lambda-notation
• An efficient machine-independent procedure for garbage collection in various list structures
• Symmetric list processor

This page was built for publication: Output driven interpretation of recursive programs, or writing creates and destroys data structures