Semantics (computer science)
Semantics | ||||||||
---|---|---|---|---|---|---|---|---|
| ||||||||
|
||||||||
Semantics of programming languages | ||||||||
|
||||||||
Part of Formal languages |
In
Semantics describes the processes a computer follows when
History
In 1967, Robert W. Floyd published the paper Assigning meanings to programs; his chief aim was "a rigorous standard for proofs about computer programs, including proofs of correctness, equivalence, and termination".[2][3] Floyd further wrote:[2]
A semantic definition of a programming language, in our approach, is founded on a syntactic definition. It must specify which of the phrases in a syntactically correct program represent commands, and what conditions must be imposed on an interpretation in the neighborhood of each command.
In 1969, Tony Hoare published a paper on Hoare logic seeded by Floyd's ideas, now sometimes collectively called axiomatic semantics.[4][5]
In the 1970s, the terms operational semantics and denotational semantics emerged.[5]
Overview
The field of formal semantics encompasses all of the following:
- The definition of semantic models
- The relations between different semantic models
- The relations between different approaches to meaning
- The relation between computation and the underlying mathematical structures from fields such as logic, set theory, model theory, category theory, etc.
It has close links with other areas of
Approaches
There are many approaches to formal semantics; these belong to three major classes:
- functional languages often translate the language into domain theory. Denotational semantic descriptions can also serve as compositional translations from a programming language into the denotational metalanguage and used as a basis for designing compilers.
- Operational semantics,[7] whereby the execution of the language is described directly (rather than by translation). Operational semantics loosely corresponds to interpretation, although again the "implementation language" of the interpreter is generally a mathematical formalism. Operational semantics may define an abstract machine (such as the SECD machine), and give meaning to phrases by describing the transitions they induce on states of the machine. Alternatively, as with the pure lambda calculus, operational semantics can be defined via syntactic transformations on phrases of the language itself;
- Axiomatic semantics,[8] whereby one gives meaning to phrases by describing the axioms that apply to them. Axiomatic semantics makes no distinction between a phrase's meaning and the logical formulas that describe it; its meaning is exactly what can be proven about it in some logic. The canonical example of axiomatic semantics is Hoare logic.
Apart from the choice between denotational, operational, or axiomatic approaches, most variations in formal semantic systems arise from the choice of supporting mathematical formalism.[citation needed]
Variations
Some variations of formal semantics include the following:
- Action semantics[9] is an approach that tries to modularize denotational semantics, splitting the formalization process in two layers (macro and microsemantics) and predefining three semantic entities (actions, data and yielders) to simplify the specification;
- program semantics in a formal manner. It also supports denotational semantics and operational semantics;
- context-sensitiveconditions;
- Categorical (or "functorial") semantics[11] uses category theory as the core mathematical formalism. Categorical semantics is usually proven to correspond to some axiomatic semantics that gives a syntactic presentation of the categorical structures. Also, denotational semantics are often instances of a general categorical semantics;[12]
- process calculi;
- Game semantics[14] uses a metaphor inspired by game theory;
- Predicate transformer semantics,[15] developed by Edsger W. Dijkstra, describes the meaning of a program fragment as the function transforming a postcondition to the precondition needed to establish it.
Describing relationships
For a variety of reasons, one might wish to describe the relationships between different formal semantics. For example:
- To prove that a particular operational semantics for a language satisfies the logical formulas of an axiomatic semantics for that language. Such a proof demonstrates that it is "sound" to reason about a particular (operational) interpretation strategy using a particular (axiomatic) proof system.
- To prove that operational semantics over a high-level machine is related by a simulation with the semantics over a low-level machine, whereby the low-level abstract machine contains more primitive operations than the high-level abstract machine definition of a given language. Such a proof demonstrates that the low-level machine "faithfully implements" the high-level machine.
It is also possible to relate multiple semantics through abstractions via the theory of abstract interpretation.[citation needed]
See also
- Computational semantics
- Formal semantics (logic)
- Formal semantics (linguistics)
- Ontology
- Ontology (information science)
- Semantic equivalence
- Semantic technology
References
- ISBN 978-3-540-07142-6.
- ^ ISBN 0821867288.
- ^ Knuth, Donald E. "Memorial Resolution: Robert W. Floyd (1936–2001)" (PDF). Stanford University Faculty Memorials. Stanford Historical Society.
- S2CID 207726175.
- ^ ISBN 978-0-262-23169-5.
- ISBN 9780205104505.
- ^ Plotkin, Gordon D. (1981). A structural approach to operational semantics (Report). Technical Report DAIMI FN-19. Computer Science Department, Aarhus University.
- ^ S2CID 11060837.
- ^ Mosses, Peter D. (1996). Theory and practice of action semantics (Report). BRICS Report RS9653. Aarhus University.
- ISBN 9780387500560.
- PMID 16591125.
- .
- .
- ISBN 9780521580571.
- S2CID 1679242.
Further reading
- Textbooks
- ISBN 0821867288.
- ISBN 978-0-471-92772-3.
- ISBN 978-0-13-805599-8.
- ISBN 0-262-07143-6.
- Nielson, H. R.; Nielson, Flemming (1992). Semantics With Applications: A Formal Introduction (PDF). Wiley. ISBN 978-0-471-92980-2. Archived from the original(PDF) on 2012-04-17. Retrieved 2011-05-27.
- ISBN 0-262-73103-7.
- Mitchell, John C. (1995). Foundations for Programming Languages (Postscript).
- ISBN 0-201-65697-3.
- ISBN 0-521-59414-6.
- Harper, Robert (2006). Practical Foundations for Programming Languages (PDF). Archived from the original (PDF) on 2007-06-27. (Working draft)
- Nielson, H. R.; Nielson, Flemming (2007). Semantics with Applications: An Appetizer. Springer. ISBN 978-1-84628-692-6.
- ISBN 978-1-118-00747-1.
- Krishnamurthi, Shriram (2012). "Programming Languages: Application and Interpretation" (2nd ed.).
- Lecture notes
- Winskel, Glynn. "Denotational Semantics" (PDF). University of Cambridge.
External links
- Aaby, Anthony (2004). Introduction to Programming Languages. Archived from the original on 2015-06-19. Semantics.