Our website is made possible by displaying online advertisements to our visitors.
Please consider supporting us by disabling your ad blocker.
Algebraic semantics (computer science)
| Semantics | ||||||||
|---|---|---|---|---|---|---|---|---|
|
||||||||
|
Semantics of programming languages | ||||||||
|
||||||||
In computer science, algebraic semantics is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program specifications in a formal manner.[1][2][3][4]
- ^ J.A. Goguen; J.W. Thatcher; E.G. Wagner; J.B. Wright (1977). "Initial algebra semantics and continuous algebras". Journal of the ACM. 24 (1): 68–95. doi:10.1145/321992.321997. S2CID 11060837.
- ^ J.A. Goguen; J.W. Thatcher; E.G. Wagner (1978). "An initial algebra approach to the specification, correctness and implementation of abstract data types". In R.T. Yeh (ed.). Current Trends in Programming Methodology, Vol. IV: Data Structuring. Prentice Hall. pp. 80–149.
- ^ J.A. Goguen; C. Kirchner; H. Kirchner; A. Megrelis; J. Meseguer (1988). "An introduction to OBJ3". Proceedings of the First Workshop on Conditional Term Rewriting Systems. Lecture Notes in Computer Science. Vol. 308. Springer. pp. 258–263. doi:10.1007/3-540-19242-5_22. ISBN 978-3-540-19242-8.
- ^ J.A. Goguen; G. Malcolm (1996). Algebraic Semantics of Imperative Programs. MIT Press. ISBN 9780262071727.
Previous Page Next Page
