Execution architectures for program algebra
type: Item
instance of: scholarly article
title: Execution architectures for program algebra
zbMATH Open document ID: 1116.68024
author: Alban Ponse
author: J. A. Bergstra
published in: Journal of Applied Logic
publication date: 2007-05-18T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5154736
zbMATH Keywords: halting problem
zbMATH Keywords: execution of programs
zbMATH Keywords: program algebra
zbMATH Keywords: Turing machine
MaRDI profile type: Publication
full work available at URL: j.jal.2005.10.013
OpenAlex ID: W1965715676
cites work: Processes and the denotational semantics of concurrency
cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
cites work: Q4449159
cites work: Q4525274
cites work: A propositional logic with 4 values: true, false, divergent and meaningless
cites work: Process algebra for synchronous communication
cites work: Program algebra for sequential code
cites work: New Computational Paradigms
cites work: Bochvar-McCarthy logic and process algebra
cites work: Register-machine based processes
cites work: Non-regular iterators in process algebra
cites work: Combining programs and state machines
cites work: Q4941495
cites work: Q3824353
cites work: Q5573961
DOI: 10.1016/J.JAL.2005.10.013
description: scientific article; zbMATH DE number 5154736