Advertisement

Semantics of computation

  • J. A. Goguen
Submitted Abstract
Part of the Lecture Notes in Computer Science book series (LNCS, volume 25)

Keywords

Monoidal Category Finite Automaton Program Scheme Derivation Tree Tree Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 1.
    Thatcher, J. W. "Characterizing Derivation Trees of Context-Free Grammars Through a Generatlization of Finite Automaton Theory," J. Comp. and Sys. Sci. 1, pp. 317–322, 1967.MathSciNetMATHGoogle Scholar
  2. 2.
    Thatcher, J. W. and Wright, J. B. "Generalized Finite Automata With an Application to a Decision Problem of Second-Order Logic," Math. Sys. Th. 2, pp. 57–81, 1968.CrossRefMathSciNetGoogle Scholar
  3. 3.
    Eilenberg, S. and Wright, J. B. "Automata in General Algebras," Infom. Control 11, pp. 52–70, 1967.MathSciNetGoogle Scholar
  4. 4.
    Goguen, J. A., Thatcher, J. W., Wagner E. G. and Wright, J. B. "A Junction Between Computer Science and Category Theory, I: Basic Concepts and Examples (Part 1)," Report RC 4526, IBM Watson Research Center, September 1972. (Part 2), to appear.Google Scholar
  5. 5.
    Mac Lane, S. and Birkhoff, G. Algebra, Macmillan, 1967.Google Scholar
  6. 6.
    Maibaum, T. S. E. "The Characterization of the Derivation Trees of Context-Free Sets of Terms as Regular Sets," Proceedings 13th Annual Symposium Switching and Automata Theory, College Park, Md., pp. 224–230, 1972.Google Scholar
  7. 7.
    Turner, R. "An Infinite Hierarchy of Term Languages — An Approach to Mathematical Complexity," Automata, Languages and Programming (Proc. Symp. IRIA, 1973) ed. M. Nivat, North Holland, pp. 593–608, 1973.Google Scholar
  8. 8.
    Wand, M. "An Algebraic Formulation of the Chomsky Hierarchy," Proc. of the First International Symposium: Category Theory Applied to Computation and Control, 1973.Google Scholar
  9. 9.
    Knuth, D. "Semantics of Context-Free Languages," Math Sys. Th. 2, pp. 127–145, 1963.CrossRefMathSciNetGoogle Scholar
  10. 10.
    Naur, P. et al "Revised Report on the Algorithmic Language ALGOL 60," Communications of the ACM 6, pp. 1–17, 1963.CrossRefGoogle Scholar
  11. 11.
    Scott, D. "The Lattice of Flow Diagrams," Symp. on Semantics of Algorithmic Languages, Lecture Notes in Math V. 188, Springer Verlag, 311–366, 1970.Google Scholar
  12. 12.
    Scott, D. and Strachey C. "Toward a Mathematical Semantics for Computer Languages," Proc. Symp. Computers and Automata, Polytechnic Inst. of Brooklyn, pp. 19–46, 1971.Google Scholar
  13. 13.
    Goguen, J. A. "On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes," Proc. 13th IEEE Symposium on Switching and Automata, College Park, Md., pp. 51–60, 1972.Google Scholar
  14. 14.
    Burstall, R. M. "An Algebraic Description of Programs with Assertions, Verification and Simulation," Proceedings of the ACM Conference on Proving Assertions About Programs, Las Cruces, N. M., pp. 7–14, 1972.Google Scholar
  15. 15.
    Floyd, R. W. "Assigning Meanings to Programs," Proc. Symp. Appl. Math 19 American Math. Soc., pp. 19–32, 1967.Google Scholar
  16. 16.
    Manna, Z. "The Correctness of Programs," J. Comp. and Sys. Sci. 3, pp. 119–127, 1969.MathSciNetGoogle Scholar
  17. 17.
    Burstall, R. M. and Thatcher, J. W. "The Algebraic Theory of Recursive Program Schemes," Proc. of the First International Symposium: Category Theory Applied to Computation and Control, 1973.Google Scholar
  18. 18.
    Goguen, J. A. "Minimal Realization Situations," unpublished manuscript from 1969; to appear in ADJ.Google Scholar
  19. 19.
    Ehrig, H. and Kreowski, J. J. "Power and Initial Automata in Pseudo-Closed Categories," Proc. of the First International Symposium: Category Theory Applied to Computation and Control, 1973.Google Scholar
  20. 20.
    Lawvere, F. W. "Functorial Semantics of Algebraic Theories," Proc. Nat. Acad. Sci. 50, pp. 870–872, 1963.MathSciNetCrossRefGoogle Scholar
  21. 21.
    Goguen, J. A. "Discrete-Time Machines in Closed Monoidal Categories, I," Quarterly Report #30, Inst. for Computer Res., University of Chicago, Section IIB, 1971; To appear in Jnl. Comp. and Sys. Sci., Summarized in "Minimal Realization of Machines in Closed Categories," Bull. Amer. Math. Soc. 78, pp. 777–783, 1972.MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Goguen, J. A. "Discrete-Time Machines in Closed Monoidal Categories II," in preparation.Google Scholar
  23. 23.
    Arbib, M. A. and Manes, E. G. "Machines in a Category: An Expository Intraduction," to appear in the SIAM Review 16, 1974.Google Scholar
  24. 24.
    Bainbridge, E. S. "Addressed Machines and Duality," Proc. of First International Symp.: Category Theory Applied to Computation and Control, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • J. A. Goguen
    • 1
  1. 1.Computer ScienceUniversity of CaliforniaLos AngelesUSA

Personalised recommendations