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

Annals of Pure and Applied Logic

Volumn 81, Issue 1-3, 1996, Pages 75-113

  Feferman, Solomon ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030242142     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(96)88189-9     Document Type: Article

References (24)

1. [1] H. Abelson, G.J. Sussman and J. Sussman, Structure and Interpretation of Computer Programs (MIT Press, Cambridge, MA, 1985).
2. [2] Y.L. Eršov, Computable functionals of finite types, Algebra and Logic 11 (1972) 203-242 (translated from Algebra i Logika 11 (4) (1972) 367-437).
3. [3] S. Feferman, Inductive schemata and recursively continuous functionals, in: R.O. Gandy and J.M.E. Hyland, eds., Logic Colloquium, '76 (North-Holland, Amsterdam, 1977) 373-392.
4. [4] S. Feferman, Generating schemes for partial recursively continuous functionals, in: Colloque International de Logique (Éditions de CNRS, Paris, 1977) 191-198.
5. [5] S. Feferman, A new approach to abstract data types II. Computations on ADTs as ordinary computation, in: E. Börger et al., eds., Computer Science Logic, Lecture notes in Computer Science, 626 (Springer, Berlin, 1991) 79-95.
6. [6] S. Feferman, A new approach to abstract data types I. Informal development, Math. Struct. Comput. Sci. 2 (1992) 193-229.
7. [7] H. Geuvers, Inductive and co-inductive types with iteration and recursion (notes of a talk at the BRA-LF meeting in Edinburgh, May 1991 (1992)).
8. [8] S.C. Kleene, Introduction to Metamathematics (North-Holland, Amsterdam, 1952).
9. [9] S.C. Kleene, Recursive functionals and quantifiers of finite types I, Trans. Amer. Math. Soc. 91 (1959) 1-52.
10. [10] S.C. Kleene, Countable functionals, in: A. Heyting, ed., Constructivity in Mathematics, (North-Holland, Amsterdam 1959) 81-100.
11. [11] G. Kreisel, Interpretation of analysis by means of constructive functionals of finite types, in: A. Heyting, ed., Constructivity in Mathematics (North-Holland, Amsterdam 1959) 101-128.
12. [12] F. Leclerc and C. Paulin-Mohring, Programming with streams in Coq - a case study: The sieve of Eratasthenes, in: H. Barendregt and T. Nipkow, eds., Types for Proofs and Programs, Lecture Notes in Computer Science 806 (1994) 191-212.
13. [13] Z. Manna, Mathematical Theory of Computation, (McGraw-Hill, New York, 1974).
14. [14] N.P. Mendler, Recursive types and type-constraints in second-order lambda calculus, in: Proc. 2nd Annual Symposium on Logic and Computer Science (IEEE Computer Society Press, 1987) 30-36.
15. [15] Y.N. Moschovakis, Abstract recursion as a foundation of the theory of recursive algorithms, in: M.M. Richter et al., eds., Computation and Proof Theory, Lecture Notes in Mathematics 1104 (1984) 289-364.
16. [16] Y.N. Moschovakis, The formal language of recursion, J. Symbolic Logic 54 (1989) 1216-1252.
17. [17] J. Myhill and J. Shepherdson, Effective operations on partial recursive functions, Zeitschrift Math. Logik u. Grundlagen der Mathematik 1 (1955) 310-317.
18. [18] L. Paulson, Co-induction and co-recursion in higher-order logic, Technical Report 334, Computer Lab., Univ. of Cambridge (1994).
19. [19] R.A. Platek, Foundations of recursion theory, Ph.D. Thesis, Stanford University, Stanford, CA (1966).
20. [20] V.Y. Sazonov, Degrees of parallelism in computations, in: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 45 (1976) 517-523.
21. [21] J.V. Tucker and J.I. Zucker, Computable functions on stream algebras, in: H. Schwichtenberg, ed., Proc. NATO Summer School in Proof and Computation, Marktoberdorf, 1993 (Springer, Heidelberg, 1994) 341-382.
22. [22] J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (MIT Press, Cambridge, MA and Elsevier, Amsterdam, 1990).
23. [23] J. Vuillemin, Proof techniques for recursive programs, Ph.D. Thesis, Stanford University, Stanford, CA (1973).
24. [24] G. Winskel, The Formal Semantics of Programming Languages. An Introduction (MIT Press, Cambridge, MA, 1993).