Proving algorithms by tail functions

DOI10.1016/S0019-9958(71)90355-XMaRDI QIDQ5639702zbMATH OpenOpenAlexFDO

Authors Antoni Mazurkiewicz

Publication date 1971

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(71)90355-x

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited in

(7)

• Programs and logics
• Continuation semantics for flowgraph equations
• A syntactic theory of sequential control
• Conservation and uniform normalization in lambda calculi with erasing reductions
• scientific article; zbMATH DE number 1497789 (Why is no real title available?)
• A survey of state vectors
• A denotational semantics for shared-memory parallelism and nondeterminism

This page was built for publication: Proving algorithms by tail functions

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