scientific article
From MaRDI portal
zbMath0599.03052MaRDI QIDQ3734395
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
definabilityconcurrent algorithmsrecursive definitionformal language of recursionsecond order recursion schemesspecification and mathematical analysis of algorithms
Algorithms in computer science (68W99) Abstract and axiomatic computability and recursion theory (03D75)
Related Items
Computation on abstract data types. The extensional approach, with an application to streams, The equational logic of fixed points, Parametrization over inductive relations of a bounded number of variables, When is arithmetic possible?, Theses for Computation and Recursion on Concrete and Abstract Structures, Intensional aspects of function definitions, Query languages for hierarchic databases, Feferman on Computability, A Behavioural Theory of Recursive Algorithms, Group axioms for iteration, Hereditarily-finite sets, data bases and polynomial-time computability, Computational foundations of basic recursive function theory, A Survey on Analog Models of Computation
