Jump to content

Algebraic semantics (computer science)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Laiwoonsiu (talk | contribs) at 04:22, 29 November 2021 (Corrected the reference.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

It has been suggested that this article be merged into Algebraic semantics (mathematical logic). (Discuss) Proposed since August 2021.

Subfields
Computational Lexical Lexis Lexicology Statistical Structural
Topics
Analysis Compositionality Context Prototype theory Force dynamics Semantic feature Semantic gap Theory of descriptions
Analysis
Latent Computational Machine learning
Applications
Semantic file system Semantic desktop Semantic matching Semantic parsing Semantic similarity Semantic query Semantic Web Semantic wiki

In computer science, algebraic semantics is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program semantics in a formal manner.

See also

References

Eric G. Wagner (1995). "Algebraic Semantics". In Samson Abramsky; Dov M. Gabbay; Thomas S. E. Maibaum (eds.). Handbook of Logic in Computer Science. Vol. Vol. 3: Semantic structures. Clarendon Press. pp. 323–393. ISBN 9780198537625. {{cite book}}: |volume= has extra text (help)
Joseph Goguen; Grant Malcolm (1996). Algebraic semantics of imperative programs. MIT Press. ISBN 9780262071727.

This computer science article is a stub. You can help Wikipedia by expanding it.

\Gamma \!\vdash

This programming language theory or type theory-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Algebraic_semantics_(computer_science)&oldid=1057702646"

Hidden categories: