Computation on abstract data types. The extensional approach, with an application to streams

Annals of Pure and Applied Logic 81 (1-3):75-113 (1995)
  Copy   BIBTEX

Abstract

In this paper we specialize the notion of abstract computational procedure previously introduced for intensionally presented structures to those which are extensionally given. This is provided by a form of generalized recursion theory which uses schemata for explicit definition, conditional definition and least fixed point recursion in functional of type level 2 over any appropriate structure. It is applied here to the case of potentially infinite streams as an abstract data type

Categories

Keywords

Reprint years

1996

DOI

10.1016/0168-0072(96)88189-9

Other Versions

reprint Feferman, Solomon (2002) "Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams". Bulletin of Symbolic Logic 8(4):538-542

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

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

Review: Solomon Feferman, Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams. [REVIEW]Jeffery Zucker - 2002 - Bulletin of Symbolic Logic 8 (4):538-542.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
A term calculus for (co-) recursive definitions on streamlike data structures.Wilfried Buchholz - 2005 - Annals of Pure and Applied Logic 136 (1):75-90.
Rethinking Revision.P. D. Welch - 2019 - Journal of Philosophical Logic 48 (1):137-154.
Induction–recursion and initial algebras.Peter Dybjer & Anton Setzer - 2003 - Annals of Pure and Applied Logic 124 (1-3):1-47.
Explicit mathematics with the monotone fixed point principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.
Higher type recursion, ramification and polynomial time.Stephen J. Bellantoni, Karl-Heinz Niggl & Helmut Schwichtenberg - 2000 - Annals of Pure and Applied Logic 104 (1-3):17-30.

Analytics

Added to PP
2009-01-28

Downloads
69 (#306,417)

6 months
18 (#164,932)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The unfolding of non-finitist arithmetic.Solomon Feferman & Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):75-96.
Definedness.Solomon Feferman - 1995 - Erkenntnis 43 (3):295 - 320.
Subrecursive functions on partial sequences.Karl-Heinz Niggl - 1999 - Archive for Mathematical Logic 38 (3):163-193.

Add more citations

References found in this work

Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 101--128.
Countable functionals.S. C. Kleene - 1959 - Journal of Symbolic Logic 27 (3):81--100.
Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.
Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):310-317.
The formal language of recursion.Yiannis N. Moschovakis - 1989 - Journal of Symbolic Logic 54 (4):1216-1252.

View all 6 references / Add more references