Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- PART II LOGIC AND COMPUTATION
- A pragmatic interpretation of substructural logics
- Computational complexity and induction for partial computable functions in type theory
- Computability theory: structure or algorithms
- Three processes in natural language interpretation
- Infinitary initial algebra specifications for stream algebras
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
Infinitary initial algebra specifications for stream algebras
from PART II - LOGIC AND COMPUTATION
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- PART II LOGIC AND COMPUTATION
- A pragmatic interpretation of substructural logics
- Computational complexity and induction for partial computable functions in type theory
- Computability theory: structure or algorithms
- Three processes in natural language interpretation
- Infinitary initial algebra specifications for stream algebras
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Reflections on the Foundations of MathematicsEssays in Honor of Solomon Feferman, pp. 228 - 248Publisher: Cambridge University PressPrint publication year: 2002
References
[1] , , and , Domain representation of streams, In Möller and Tucker [20].
[2] , , , andM.J. O'Donnell, Exact real arithmetic: A case study in higher programming, ACMsymposium on Lisp and functional programming, 1986.
[3] , Effective and sequential definition by cases on the reals via infinite signed-digit numerals, Electronic Notes in Theoretical Computer Science, vol. 13 (1998).Google Scholar
[4] , Computation on abstract data types: The extensional approach, with an application to streams, Annals of Pure & Applied Logic, vol. 81 (1996), pp. 75-113.Google Scholar
[5] , Computability theory: Structure or algorithms, In this volume.
[6] , , , and , Initial algebra semantics and continuous algebras, Journal of the Association for Computing Machinery, vol. 24 (1977), pp. 68-95.Google Scholar
[7] and , The algebraic specification of abstract data types, Acta Informatica, vol. 10 (1978), pp. 27-52.Google Scholar
[8] , , , and (editors), Hoa –93: International workshop on higher-order algebra, logic and term rewriting, Lecture Notes in Computer Science, vol. 816, Springer- Verlag, 1994.
[9] , Languages with expressions of infinite length, North Holland, 1964.
[10] , ,, and , Transfinite reductions in orthogonal term rewriting systems, Information & Control, vol. 119 (1995), pp. 18-38.Google Scholar
[11] and , On the power of higher-order algebraic specification methods, Information & Computation, vol. 124 (1995), pp. 85-101.Google Scholar
[12] , Algebraic systems, Grundlehren der mathematischenWissenschaften, vol. 192, Springer-Verlag, 1973.
[13] , Universal algebra in higher types, Theoretical Computer Science, vol. 100 (1992), pp. 385-417.Google Scholar
[14] , Topological methods for algebraic specification, TheoreticalComputer Science, vol. 166 (1996), pp. 263-290.Google Scholar
[15] and , Specification and verification in higher order algebra: a case study of convolution, Higher order algebra, logic and term rewriting (, , , and TNipkow, editors), Lecture Notes inComputer Science, vol. 816, Springer-Verlag, 1994, pp. 189-222.
[16] and , Universal algebra, Handbook of logic in computer science (, , and , editors), vol. 1, Oxford University Press, 1992, pp. 189- 411.
[17] and , Initiality, induction and computability, Algebraic methods in semantics ( and , editors), Cambridge University Press, 1985, pp. 459-541.
[18] , On the algebraic specification of infinite objects — ordered and continuous models of algebraic types, Acta Informatica, vol. 22 (1985), pp. 537-578.Google Scholar
[19] , Higher-order algebraic specifications, Habilitationsschrift, Technische Universität München, 1987.
[20] and (editors), Prospects for hardware foundations, Lecture Notes in Computer Science, vol. 1546, Springer-Verlag, 1998.
[21] , The formal language of recursion, The Journal of Symbolic Logic, vol. 54 (1989), pp. 1216-1252.Google Scholar
[22] and , Computability in analysis and physics, Springer-Verlag, 1989.
[23] , Jr., Theory of recursive functions and effective computability,McGraw-Hill, 1967.
[25] and , Effective algebras, Handbook of logic in computer science (, , and , editors), vol. 4, Oxford University Press, 1995, pp. 357-526.
[26] , Proof theory (2nd ed.), North Holland, 1987.
[27] and , Program correctness over abstract data types, with error-state semantics, CWI Monographs, vol. 6, North Holland, 1988.
[28] and , Projections of semicomputable relations on abstract data types, International Journal of Foundations of Computer Science, vol. 2 (1991), pp. 267-296.Google Scholar
[29] and , Provable computable selection functions on abstract structures, Proof theory (, , and , editors), Cambridge University Press, 1993, pp. 277-306.
[30] and , Computable functions on stream algebras, Proof and computation: NATO Advanced Study Institute International Summer School at Marktoberdorf, 1993 (, editor), Springer-Verlag, 1994, pp. 341-382.
[31] and , Computation by ‘while’ programs on topological partial algebras, Theoretical Computer Science, vol. 219 (1999), pp. 379-420.Google Scholar
[32] and , Computable functions and semicomputable sets on many-sorted algebras, Handbook of logic in computer science (, , and , editors), vol. 5, Oxford University Press, 2000, pp. 317-523.
[33] and , Abstract computability, algebraic specification and initiality, ACM Transactions on Computational Logic, (2001), To appear.
[34] , Universal algebra for computer scientists, EATCS Monographs, vol. 25, Springer-Verlag, 1992.
[35] , Computable analysis: An introduction, Springer-Verlag, 2000.
[36] , Computing with infinite objects, Theoretical Computer Science, vol. 10 (1980), pp. 133-155.Google Scholar
[37] , Algebraic specification, Handbook of theoretical computer science, Vol. B: Formal methods and semantics (, editor), North Holland, 1991, pp. 675-788.