Straight-line instruction sequence completeness for total calculation on cancellation meadows
DOI10.1007/S00224-010-9272-9zbMATH Open1217.68141OpenAlexW2098463276MaRDI QIDQ538468FDOQ538468
Authors: J. A. Bergstra, Inge Bethke 
Publication date: 25 May 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9272-9
Recommendations
fieldsprogram algebrastraight-line programsinstruction sequencescalculation in meadowsdivision-by-zeroequational specificationexecution of programsmeadows
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cites Work
- The rational numbers as an abstract data type
- The initial meadows
- Meadows and the equational specification of division
- The structure of finite meadows
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
- Program algebra for sequential code
- Instruction sequence processing operators
- Combining programs and state machines
- Thread algebra for strategic interleaving
- Title not available (Why is that?)
- Application of universal constraints in the analysis of classification algorithms
- On the Simplification and Equivalence Problems for Straight-Line Programs
- Logical Approaches to Computational Barriers
- Decision problems for pushdown threads
Cited In (3)
This page was built for publication: Straight-line instruction sequence completeness for total calculation on cancellation meadows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538468)
