Computation on abstract data types. The extensional approach, with an application to streams
From MaRDI portal
Publication:1923575
DOI10.1016/0168-0072(96)88189-9zbMath0858.03048MaRDI QIDQ1923575
Publication date: 19 March 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(96)88189-9
abstract data types; generalized recursion theory; \(A\)-stream computation; general theory of computation; many-sorted functional structures
68W30: Symbolic computation and algebraic computation
68Q65: Abstract data types; algebraic specification
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Uses Software
Cites Work
- Computable functionals of finite types
- Effective operations on partial recursive functions
- Recursive Functionals and Quantifiers of Finite Types I
- The formal language of recursion
- A new approach to abstract data types, I Informal development
- Shorter Notes: A Note on the Failure of the Relativized Enumeration Theorem in Recursive Function Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item