Monadic computation and iterative algebraic theories

Studies in Logic and the Foundations of Mathematics

Volumn 80, Issue C, 1975, Pages 175-230

  Elgot, Calvin C ^a,b  

^a IBM   (United States)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957661113     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(08)71949-9     Document Type: Article

References (11)

1. Davis, Martin, Computability and Unsolvability, 1958, McGraw-Hill, New York.
2. Eilenberg, Samuel, Jesse Wright, B., Automata in general algebras. Information and Control, 11(4), 1967.
3. Calvin Elgot, C., Algebraic theories and program schemes. Engeler, E., (eds.) Symposium on semantics of Algorithmic Languages, 1971, Springer, Berlin.
4. Hermes, Hans, Enumerability, Decidability, Computability, 1965, Springer, Berlin.
5. William Lawvere, F., Functorial semantics of algebraic theories. Proceedings of the National Acedemy of Sciences 50:5 (1963), 869–872.
6. Markov, A.A., Theory of Algorithms, 1954, Academy of Sciences of the USSR [English translation in 1961.].
7. Post, Emil, Finite combinatory processes, formulation I. Journal of Symbolic Logic 1 (1936), 103–105.
8. Rogers, Hartley Jr., Theory of Recursive Functions and Effective Computability, 1967, McGraw-Hill, New York.
9. Shepherdson, J.C., Sturgis, H.E., The computability of partial recursive functions. Journal of the Association of Computing Machinery 10 (1963), 217–255.
10. Alan Turing, M., On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Ser. 2 42 (1936), 230–265 corrections, Journal of the Association of Computing Machinery, 43(1937) 544–546.
11. Niklaus Wirth, On certain basic concepts of programming languages, Technical Report No. CS65, pp. 27–28, Computer Science Department, School of Humanities and Sciences, Stanford University, Stanford, Calif. (May, 1967).