Boolean-valued loops

DOI10.1007/BF01931683zbMATH Open0324.68013OpenAlexW1983799840MaRDI QIDQ4088262FDOQ4088262

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

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

Cited In (1)

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

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)