Primitive program algebras of computable functions
From MaRDI portal
Recommendations
Cites work
- Can programming be liberated from the von Neumann style?
- Computable queries for relational data bases
- Computable stack functions for semantics of stack programs
- scientific article; zbMATH DE number 3823137 (Why is no real title available?)
- On the theory of program algebras
- Polynomial queries to relational data bases
- Sequence recursiveness without cylindrification and limited register machines
Cited in
(8)- Theoretical aspects of structured-modular composition programming: Computability of the operations of the algebra of morphisms
- Primitive program algebras of functions of set (multiset) arguments and values
- scientific article; zbMATH DE number 3885887 (Why is no real title available?)
- scientific article; zbMATH DE number 3864500 (Why is no real title available?)
- scientific article; zbMATH DE number 4047051 (Why is no real title available?)
- scientific article; zbMATH DE number 4088901 (Why is no real title available?)
- Program algebras of recursive functions
- scientific article; zbMATH DE number 785052 (Why is no real title available?)
This page was built for publication: Primitive program algebras of computable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802614)