Boolean-valued loops

DOI10.1007/BF01931683zbMath0324.68013OpenAlexW1983799840MaRDI QIDQ4088262

Daniel P. Friedman, David S. Wise, Stuart C. Shapiro, Mitchell Wand

Publication date: 1975

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931683

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (1)

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

Uses Software

• ALGOL 68

Cites Work

• Analysis of structured programs
• Report on the algorithmic language ALGOL 68
• On the capabilities of while, repeat, and exit statements
• Multiple exits from a loop using neither GO TO nor labels
• Flow diagrams, turing machines and languages with only two formation rules
• An axiomatic basis for computer programming
• BLISS
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean-valued loops