structural operational semantics
E811501
Structural operational semantics is a framework in theoretical computer science for defining the behavior of programming languages by specifying how each syntactic construct transitions between states using inference rules.
All labels observed (1)
| Label | Occurrences |
|---|---|
| structural operational semantics canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9634211 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: structural operational semantics Context triple: [Gordon Plotkin, knownFor, structural operational semantics]
-
A.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
B.
Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
"Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional languages.
-
C.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
D.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: structural operational semantics Target entity description: Structural operational semantics is a framework in theoretical computer science for defining the behavior of programming languages by specifying how each syntactic construct transitions between states using inference rules.
-
A.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
B.
Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
"Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional languages.
-
C.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
D.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- F. None of above. chosen
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
operational semantics
ⓘ
semantics framework ⓘ theoretical computer science concept ⓘ |
| appliesTo |
concurrent systems
ⓘ
process calculi ⓘ programming languages ⓘ |
| basedOn | inference rules ⓘ |
| captures |
control flow of programs
ⓘ
interaction between program and state ⓘ step-by-step execution of programs ⓘ |
| characterizedBy |
rule-based description of program behavior
ⓘ
small-step semantics ⓘ state transition relations ⓘ syntax-directed rules ⓘ |
| defines |
operational rules for each syntactic construct
ⓘ
transition relation between program configurations ⓘ |
| describedIn | “A Structural Approach to Operational Semantics” NERFINISHED ⓘ |
| enables |
compositional description of language constructs
ⓘ
mechanized semantics in proof assistants ⓘ |
| field | theoretical computer science ⓘ |
| formalism |
inference rule notation
ⓘ
judgment forms ⓘ structural rules ⓘ |
| hasVariant |
big-step semantics
ⓘ
natural semantics ⓘ small-step semantics ⓘ |
| influenced |
development of SOS rule formats
ⓘ
probabilistic structural operational semantics ⓘ structural operational semantics with negative premises ⓘ |
| introducedBy | Gordon Plotkin NERFINISHED ⓘ |
| oftenRepresentsStateAs |
environment
ⓘ
heap ⓘ store ⓘ |
| publicationYear | 1981 ⓘ |
| relatedTo |
abstract machines
ⓘ
axiomatic semantics ⓘ bisimulation ⓘ denotational semantics ⓘ labelled transition systems ⓘ operational semantics ⓘ process algebra ⓘ |
| supports |
formal reasoning about program execution
ⓘ
proofs of compiler correctness ⓘ proofs of program equivalence ⓘ proofs of type soundness ⓘ |
| usedFor |
defining programming language semantics
ⓘ
describing behavior of programming languages ⓘ specifying transition systems for programs ⓘ |
| usedIn |
design of programming languages
ⓘ
formal verification ⓘ semantics of concurrency ⓘ semantics of process calculi ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: structural operational semantics Description of subject: Structural operational semantics is a framework in theoretical computer science for defining the behavior of programming languages by specifying how each syntactic construct transitions between states using inference rules.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.