Towards a calculus of algorithms

DOI10.1017/S000497270000959XMaRDI QIDQ4312395zbMATH OpenOpenAlexFDO

Authors Michael Bulmer, Desmond Fearnley-Sander, T. E. Stokes

Publication date 23 April 1995

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s000497270000959x

zbMATH Keywords

algebra of piecewise defined polynomialsBoolean powersubstitution homomorphisms

Mathematics Subject Classification ID

Boolean algebras (Boolean rings) (06E99) Applications of universal algebra in computer science (08A70) Other classes of algebras (08C99)

Recommendations

• scientific article; zbMATH DE number 3936508
• An algebraic approach to schemes of structured programs
• scientific article; zbMATH DE number 3936467
• Algebras, polynomials and programs
• scientific article; zbMATH DE number 3858395

Cites work

• Boolean constructions in universal algebra

Cited in

(11)

• Computation calculus bridging a formalization gap
• Logical language of description of polynomial computing
• From Calculus to Algorithms without Errors
• Towards an Axiomatization of Simple Analog Algorithms
• scientific article; zbMATH DE number 6698765 (Why is no real title available?)
• scientific article; zbMATH DE number 3936508 (Why is no real title available?)
• scientific article; zbMATH DE number 1210363 (Why is no real title available?)
• scientific article; zbMATH DE number 844104 (Why is no real title available?)
• scientific article; zbMATH DE number 5194318 (Why is no real title available?)
• Semigroups with if-then-else and halting programs
• A calculational derivation of the CASOP algorithm

This page was built for publication: Towards a calculus of algorithms

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