The formal language of recursion
From MaRDI portal
Publication:3480027
DOI10.2307/2274814zbMath0702.03023OpenAlexW4240626053MaRDI QIDQ3480027
Publication date: 1989
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274814
reductionsabstract algorithmformal language of recursion FLRfoundations of computation theoryKleene recursive functionals
Related Items
A new approach to abstract data types, I Informal development ⋮ Computation on abstract data types. The extensional approach, with an application to streams ⋮ Recursion and corecursion have the same equational logic ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Intensional aspects of function definitions ⋮ Computable concurrent processes ⋮ Towards a geometry of recursion ⋮ Axiomatization and characterization of BSP algorithms ⋮ Feferman on Computability ⋮ The unfolding of non-finitist arithmetic ⋮ A model of concurrency with fair merge and full recursion
