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

DOI10.1016/0168-0072(96)88189-9zbMath0858.03048OpenAlexW1973997468WikidataQ127207578 ScholiaQ127207578MaRDI QIDQ1923575

Solomon Feferman

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

zbMATH Keywords

abstract data typesgeneralized recursion theory\(A\)-stream computationgeneral theory of computationmany-sorted functional structures

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

Feferman on Computability, The unfolding of non-finitist arithmetic

Uses Software

• Coq

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