Straight-line instruction sequence completeness for total calculation on cancellation meadows
type: Item
instance of: scholarly article
title: Straight-line instruction sequence completeness for total calculation on cancellation meadows
zbMATH Open document ID: 1217.68141
author: J. A. Bergstra
author: Inge Bethke
published in: Theory of Computing Systems
publication date: 2011-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5899598
zbMATH Keywords: program algebra
zbMATH Keywords: instruction sequences
zbMATH Keywords: execution of programs
zbMATH Keywords: straight-line programs
zbMATH Keywords: division-by-zero
zbMATH Keywords: fields
zbMATH Keywords: meadows
zbMATH Keywords: equational specification
zbMATH Keywords: calculation in meadows
MaRDI profile type: Publication
full work available at URL: s00224-010-9272-9
OpenAlex ID: W2098463276
cites work: Decision problems for pushdown threads
cites work: Meadows and the equational specification of division
cites work: Program algebra for sequential code
cites work: Thread algebra for strategic interleaving
cites work: Instruction sequence processing operators
cites work: Combining programs and state machines
cites work: The rational numbers as an abstract data type
cites work: The initial meadows
cites work: The structure of finite meadows
cites work: Q3339260
cites work: Application of universal constraints in the analysis of classification algorithms
cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
cites work: On the Simplification and Equivalence Problems for Straight-Line Programs
cites work: Logical Approaches to Computational Barriers
DOI: 10.1007/S00224-010-9272-9
description: scientific article; zbMATH DE number 5899598