13. Over the top: Recursion as a functional option

In Harry van der Hulst (ed.), Recursion and Human Language. De Gruyter Mouton. pp. 233-244 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1515/9783110219258.233

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
A direct proof of schwichtenberg’s bar recursion closure theorem.Paulo Oliva & Silvia Steila - 2018 - Journal of Symbolic Logic 83 (1):70-83.
Review: Raphael M. Robinson, Recursion and Double Recursion. [REVIEW]Rózsa Péter - 1949 - Journal of Symbolic Logic 14 (3):191-192.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Robinson Raphael M.. Recursion and double recursion. Bulletin of the American Mathematical Society, Bd. 54 , S. 987–993. [REVIEW]Rózsa Péter - 1949 - Journal of Symbolic Logic 14 (3):191-192.
Transfinite recursion and computation in the iterative conception of set.Benjamin Rin - 2015 - Synthese 192 (8):2437-2462.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
Axioms for strict and lazy functional programs.Robert F. Stärk - 2005 - Annals of Pure and Applied Logic 133 (1-3):293-318.
Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.

Analytics

Added to PP
2020-06-17

Downloads
7 (#1,389,841)

6 months
5 (#644,465)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references