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

Annals of Pure and Applied Logic 81 (1-3):75-113 (1996)
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
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1016/0168-0072(96)88189-9
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,411
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
S. C. Kleene (1959). Countable Functionals. In A. Heyting (ed.), Journal of Symbolic Logic. Amsterdam: North-Holland Pub. Co.. pp. 81--100.
Yiannis N. Moschovakis (1989). The Formal Language of Recursion. Journal of Symbolic Logic 54 (4):1216-1252.

Add more references

Citations of this work BETA
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

24 ( #197,878 of 1,924,732 )

Recent downloads (6 months)

1 ( #417,923 of 1,924,732 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.