Straight-line instruction sequence completeness for total calculation on cancellation meadows

DOI10.1007/s00224-010-9272-9zbMath1217.68141OpenAlexW2098463276MaRDI QIDQ538468

Jan 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

zbMATH Keywords

fieldsstraight-line programsprogram algebrainstruction sequencescalculation in meadowsdivision-by-zeroequational specificationexecution of programsmeadows

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Transformation of fractions into simple fractions in divisive meadows ⋮ Inversive meadows and divisive meadows ⋮ Division by zero in non-involutive meadows

Cites Work

• Unnamed Item
• Instruction sequence processing operators
• Decision problems for pushdown threads
• Meadows and the equational specification of division
• Program algebra for sequential code
• Combining programs and state machines
• The structure of finite meadows
• Thread algebra for strategic interleaving
• Application of universal constraints in the analysis of classification algorithms
• The rational numbers as an abstract data type
• On the Simplification and Equivalence Problems for Straight-Line Programs
• Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
• The initial meadows
• Logical Approaches to Computational Barriers

This page was built for publication: Straight-line instruction sequence completeness for total calculation on cancellation meadows