Talk:Semantics (computer science)

This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science High‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles High This article has been rated as High-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Tip: Anchors are case-sensitive in most browsers. This article links to one or more target anchors that no longer exist. [[abstraction (computer science)#Semantics|abstractions]] The anchor (#Semantics) is no longer available because it was deleted by a user before. Please help fix the broken anchors. You can remove this template after fixing the problems. | Reporting errors

This article was the subject of a Wiki Education Foundation-supported course assignment, between 7 January 2020 and 14 April 2020. Further details are available on the course page. Student editor(s): Jagen31.

Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 08:56, 17 January 2022 (UTC)[reply]

The common sense says there are three major approaches for semantics. One example is this book (which also cites Attribute grammar as an approach). Most of the major references in semantics agree on that.

Also, I have sorted the approaches by some criterion: first three major by year/widespread, and the other ones alphabetically. It makes more sense to keep this way, unless someone who know them all and has a NOPV could sort them all by year/widespread.

- Leonardo Lang 08:13, 3 April 2006 (UTC)[reply]

Notes on my recent major edit: Summary of what I think I did:

• More intuition for what denotational/operational/axiomatic mean
• Considerable trimming of the descriptions of action semantics, etc. I don't think the "is it denotational, operational, or axiomatic?" game is all that illuminating for someone who's not already an expert.
• Examples of why you'd want to relate multiple semantics, to give some context to the mention of abstract interpretation.
• Misc. edits for prose style

k.lee 04:42, 1 June 2006 (UTC)[reply]

The current characterization of operational semantics looks a bit fuzzy. I wonder if it may be worth to distinguish reduction semantics (or rewriting semantics) out of operational semantics. In this view, operational semantics would be clearly restricted to the description of an algorithm that executes a program (typically a SECD machine, or the standard reduction strategy of lambda-calculus - see Barendregt's textbook) while reduction semantics would cover any description of the semantics of a language by oriented axioms, i.e. by rewrite rules. Typical questions relative to a reduction semantics are the confluence and the ability to contain the operational semantics (in its restricted sense) as a sequence of well-identified reduction steps. Take for instance the case of lambda-calculus: beta-reduction is confluent and contains the standard strategy of reduction; or take the case of lambda-calculus which, when extended with some apparatus for explicit substitution provides an oriented axiomatic semantics (i.e. a reduction semantics in the sense above) that contains the SECD machine algorithm. I do not have texbook references in mind for the reduction semantics terminology but many papers use this terminology. Hugo Herbelin (talk) 13:40, 10 September 2008 (UTC)[reply]

The article doesn't mention "declarative semantics" which is a widely used term. (e.g. >6,600 hits in google scholar [1]). pgr94 (talk) 13:55, 29 January 2011 (UTC)[reply]

schematics not semantics |\.^2

ASCII ART FELL FLAT, how prject?^ Aug.Real!1 67.58.229.130 (talk) 17:11, 26 July 2023 (UTC)[reply]