Computable stack functions for semantics of stack programs
type: Item
instance of: scholarly article
title: Computable stack functions for semantics of stack programs
zbMATH Open document ID: 0428.68057
DOI: 10.1016/0022-0000(79)90024-2
published in: Journal of Computer and System Sciences
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D60
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3667978
zbMATH Keywords: programs
zbMATH Keywords: stack machines
zbMATH Keywords: algebraic characterization of computable functions
zbMATH Keywords: repetition operators
zbMATH Keywords: partial recursive functions
zbMATH Keywords: Church's thesis
author: G. M. Germano
author: Andrea Maggiolo-Schettini
MaRDI profile type: Publication
full work available at URL: 0022-0000(79)90024-2
OpenAlex ID: W2061393234
cites work: ITERATION AND RECURSION
cites work: Q5612462
cites work: An arithmetical reconstruction of the liar's antinomy using addition and multiplication
cites work: A flow diagram composition of Markov's normal algorithms without concluding formulas
cites work: Equivalence of partial recursivity and computability by algorithms without concluding formulas
cites work: Q4087154
cites work: Sequence-to-sequence recursiveness
cites work: Proving a compiler correct: A simple approach
cites work: Q4107887
cites work: Q5616133
cites work: Q5732648
cites work: Q5330638
cites work: Q3856762
cites work: Q3877026
cites work: General Recursive Functions
description: scientific article; zbMATH DE number 3667978