Primitive program algebras of computable functions

DOI10.1007/BF01074828zbMath0655.68052OpenAlexW2057969738MaRDI QIDQ3802614

D. B. Buy, I. V. Red'ko

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074828

zbMATH Keywords

generating setscomputable functionsprimitive program algebras

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• On the theory of program algebras
• Polynomial queries to relational data bases
• Computable stack functions for semantics of stack programs
• Computable queries for relational data bases
• Sequence recursiveness without cylindrification and limited register machines
• Can programming be liberated from the von Neumann style?

This page was built for publication: Primitive program algebras of computable functions