Boolean-valued loops

DOI10.1007/BF01931683MaRDI QIDQ4088262zbMATH OpenOpenAlexFDO

Authors David S. Wise, Daniel P. Friedman, 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)

Cites work

• scientific article; zbMATH DE number 3471563 (Why is no real title available?)
• scientific article; zbMATH DE number 3471564 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3562486 (Why is no real title available?)
• An axiomatic basis for computer programming
• Analysis of structured programs
• BLISS
• Flow Graph Reducibility
• Flow diagrams, turing machines and languages with only two formation rules
• Multiple exits from a loop using neither GO TO nor labels
• On the capabilities of while, repeat, and exit statements
• Report on the algorithmic language ALGOL 68

Cited in

(1)

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

Describes a project that uses

Uses Software

• ALGOL 68

This page was built for publication: Boolean-valued loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088262)