Abstract
Logic has been long interested in whether answers to certain questions are computable in principle, since the outcome puts bounds on the possibilities of formalization. More recently, precise comparisons in the efficiency of decision methods have become available through the developments in complexity theory. These, however, are applications to logic, and a big question is whether methods of logic have significance in the other direction for the more applied parts of computability theory.
Programming languages offer an obvious opportunity as their syntactic formalization is well advanced; however, the semantical theory can hardly be said to be complete. Though we have many examples, we have still to give wide-ranging mathematical answers to these queries: What is a machine? What is a computable process? How (or how well) does a machine simulate a process? Programs naturally enter in giving descriptions of processes. The definition of the precise meaning of a program then requires us to explain what are the objects of computation (in a way, the statics of the problem) and how they are to be transformed (the dynamics).
So far the theories of automata and of nets, though most interesting for dynamics, have formalized only a portion of the field, and there has been perhaps too much concentration on the finite-state and algebraic aspects. It would seem that the understanding of higher-level program features involves us with infinite objects and forces us to pass through several levels of explanation to go from the conceptual ideas to the final simulation on a real machine. These levels can be made mathematically exact if we can find the right abstractions to represent the necessary structures.
The experience of many independent workers with the method of data types as lattices (or partial orderings) under an information content ordering, and with their continuous mappings, has demonstrated the flexibility of this approach in providing definitions and proofs, which are clean and without undue dependence on implementations. Nevertheless much remains to be done in showing how abstract conceptualizations can (or cannot) be actualized before we can say we have a unified theory.
- 1 B~hm, C., Ed. h-Calculus and Computer Science Theory. Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, New York, 1975.Google Scholar
- 2 Clark, K.L., and Cowell, D.F. Programs, Machines, and Computation. McGraw-Hill, New York, 1976.Google Scholar
- 3 Crossley, J,N., ed. Algebra and Logic. Papers from the 1974 Summer Res. Inst. Australian Math. Soc., Monash U. Clayton, Victoria, Australia. Lecture Notes in Mathematics, Vol. 450, Springer-Verlag, New York, 1975.Google Scholar
- 4 Donahue, J.E. Complementary Definitions of Programming Language Semantics. Lecture Notes in Computer Science, Vol. 42, Springer-Verlag, 1976. Google ScholarDigital Library
- 5 Eilenberg, S. Automata, Languages, and Machines. Academic Press, New York, 1974. Google ScholarDigital Library
- 6 van Emden, M.H., and Kowalski, R.A. The semantics of predicate logic as a programming language. J. ACM 23, 4 (Oct. 1976), 733-742. Google ScholarDigital Library
- 7 Manes, E.G., Ed. Category Theory Applied to Computation and Control. First Int. Syrup. Lecture Notes in Computer Science, Vol. 25, Springer-Verlag, New York, 1976.Google Scholar
- 8 Manna, Z. Mathematical Theory of Computation. McGraw-Hill, New York, 1974. Google ScholarDigital Library
- 9 Milne, R., and Strachey, C. A Theory of Programming Language Semantics. Chapman and Hall, London, and Wiley, New York, 2 Vols., 1976. Google ScholarDigital Library
- 10 Plotkin, G.D. A powerdomain construction. SIAM J. Comptng. 5 (1976), 452-487.Google ScholarCross Ref
- 11 Rabin, M.O., and Scott, D.S. Finite automata and their decision problems. IBM J. Res. and Develop. 3 (1959), 114-125.Google ScholarDigital Library
- 12 Scott, D.S. Data types as lattices. SIAMJ. Comptng. 5 (1976), 522-587.Google ScholarCross Ref
- 13 Stoy, J.E. Denotational Semantics- The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, Cambridge, Mass. To appear. Google ScholarDigital Library
- 14 Tennent, R.D. The denotational semantics of programming languages. Comm. ACM 19, 8 (Aug. 1976), 437-453. Google ScholarDigital Library
Recommendations
-
Logic and programming languages
ACM Turing award lecturesLogic has been long interested in whether answers to certain questions are computable in principle, since the outcome puts bounds on the possibilities of formalization. More recently, precise comparisons in the efficiency of decision methods have become ...
-
Formal Semantics of Programming Languages
These notes give an overview of the main frameworks that have been developed for specifying the formal semantics of programming languages. Some of the pragmatic aspects of semantic descriptions are discussed, including modularity, and potential ...
-
VDM semantics of programming languages: combinators and monads
AbstractThe Vienna Development Method (VDM) was developed in the early 1970s as a variant of denotational semantics. VDM descriptions of programming languages differ from the original Scott–Strachey style by making extensive use of combinators which have ...
Comments