Computable functions on final coalgebras

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 237-256

  Pattinson, Dirk ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

COALGEBRAS; COMPUTABILITY; FORMAL SYSTEM; NATURAL NUMBERS;

FORMAL LOGIC;

EID: 18944362527     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80642-X     Document Type: Conference Paper

References (17)

1. Abramsky S., Jung A. Domain Theory. Abramsky S., Gabbay D., Maibaum T.S.E. Handbook of Logic in Computer Science. volume 3:1994;Clarendon Press
2. Altenkirch T. Representations of first order function types as terminal coalgebras. Abramsky S. Typed Lambda Calculi and Applications volume 2044 of Lect. Notes in Comp. Sci. 2001;8-21
3. Barr M. Terminal coalgebras in well-fonded set theory. Theor. Comp. Sci. 114:1993;229-315. Korrigendum in Theor. Comp. Sci., 124:189-192, 1993
4. Berger U. Total Sets and Objects in Domain Theory. Journal of Pure and Applied Logic. 60:1993;91-117
5. T. Coquand. Infinite Objects in Type Theory. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer, 1993.
6. Cutland N. Computability. 1980;Cambridge University Press
7. Bishop E., Bridges D. Constructive Analysis. Number 279 in Grundleheren der mathematischen Wissenschaften :1985;Springer
8. Odifreddi P. Classical Recursion Theory. 1989;North Holland
9. Plotkin G. LCF considered as a programming language. Theor. Comp. Sci. 5:1977;223-255
10. Rutten J. Universal Coalgebra: A theory of systems. Theor. Comp. Sci. 249:(1):2000;3-80
11. Schwichtenberg H. Classifying Recursive Functions. Griffor E. Handbook of Computability Theory. 1999;Elsevier
12. Stoltenberg-Hansen V., Lindström I., Griffor E. Mathematical Theory of Domains. Number 22 in Cambridge Tracts in Theoretical Computer Science :1994;Cambridge University Press
13. A. Telford and D. Turner. Ensuring Streams Flow. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lecture Notes in Computer Science, pages 509-523. Springer, 1997.
14. Turi D., Rutten J. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science. 8:(5):1998;481-540
15. Uustalu T., Vene V. Primitive (Co)Recursion and Course of Value (Co)Iteration, Categorically. INFORMATICA (IMI, Lithuania). 10:1999;5-26
16. Weihrauch K. Computability. 1987;Springer
17. Worrell J. Terminal Sequences for Accessible Endofunctors. Jacobs B., Rutten J. Coalgebraic Methods in Computer Science (CMCS'99) volume 19 of Electr. Notes in Theoret. Comp. Sci. 1999