
	Where results make sense

Topic: Operational semantics

Related Topics

Semantics

General Semantics

Lexical semantics

Cognitive science

History of geography

History of anthropology

Keyboard shortcut

Theories and sociology of the history of science

Soft SUSY breaking term

Cognitive linguistics

Pierre de La Rue

National Hockey League President

Argosy Magazine

Barberton, Ohio

List of terrorist organizations

	ICALP/LICS/LC/PPDP 2007: Satellite workshops
		A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics.
		Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes.
		Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages.
	july2007.ii.uni.wroc.pl /workshops.html (1649 words)

	Operational semantics - Wikipedia, the free encyclopedia
		A common way to rigorously define the operational semantics, pioneered by Gordon Plotkin in his 1981 paper "A Structural Approach to Operational Sematics", is to provide a state transition system for the language of interest.
		Another approach to the semantics of concurrency is using event structures as in the Actor model.
		Defining operational semantics through a state transition system is usually done by giving an inductive definition of the set of possible transitions.
	en.wikipedia.org /wiki/Operational_semantics (279 words)

	Formal semantics of programming languages - Wikipedia, the free encyclopedia
		The formal semantics of a language is given by a mathematical model to represent the possible computations described by the language.
		Categorical semantics (also called Functorial semantics), which is most easily understood as an algebraic semantics (and so is an axiomatic semantics), but which can also be understood as a kind of denotational semantics, and indeed familiarity with category theory is today a requirement for understanding most work in denotational semantics;
		Game semantics was proposed as a kind of denotational semantics, but it has a dynamical aspect that allows it to be understood as a kind of operational semantics.
	en.wikipedia.org /wiki/Semantics_of_programming_languages (328 words)

	Learn more about Semantics in the online encyclopedia. (Site not responding. Last check: )
		In general, Semantics (from the Greek semantikos, or "significant meaning," derived from "sema," sign) always refers to some kind of meaning (of something that is written) and is thus usually opposed to syntax, which refers to the formal way in which something is written.
		Semantics is a subfield of linguistics that is traditionally defined as the study of meaning.
		One area of study is the meaning of compounds, another is the study of relations between different linguistic expressions (homonymy, synonymy, antonymy, polysemy, hypernymy, hyponymy).
	www.onlineencyclopedia.org /s/se/semantics.html (241 words)

	Operational Semantics (Site not responding. Last check: )
		It is is an operational definition of a fragment of Peano arithmetic.
		Operational definitions are favored by language implementors for the construction of compilers and by language tutorials because operational definitions describe how the actions take place.
		Operational semantics are particularly useful in constructing an implementation of a programming language.
	cs.wwc.edu /~aabyan/PLBook/book/node39.html (274 words)

	Lecture 5
		Operational Semantics Operational semantics is a familiar practice, simply by virtue of the fact that a compiler is an operational semantic definition of a language!
		The goal of operational semantics (or any dynamic semantic specification) is to specify what _the_ meaning of code in a language is, with an emphasis on "the".
		For those languages that have english specifications, the fact that a compiler is an operational semantic definition of a language doesn't change the fact that the language spec is _the_ definition of the language.
	www.cc.gatech.edu /classes/cs3411a_99_winter/lec5.html (994 words)

	Semantics (Site not responding. Last check: )
		There are several widely used techniques (algebraic, axiomatic, denotational, operational, and translation) for the description of the semantics of programming languages.
		Operational semantics may describe the syntactic transformations which mimic the execution of the program on an abstract machine or define a translation of the program into recursive functions.
		The goal of algebraic semantics is to capture the semantics of behavior by a set of axioms with purely syntactic properties.
	cs.wwc.edu /~aabyan/PLBook/HTML/Semantics.html (3586 words)

	call-by-value semantics, etc. (248 lines)
		The essence of our semantic paradigm is to think of the inheritance relationship as an implicit coercion, and to interpret it by an explicit coercion which, moreover, is already definable in the inheritance-free fragment of the language.
		In this paper, we have chosen to focus on an eager (call-by-value) operational semantics since this is the most common style of implementation for the languages we are studying and because it offers a change of pace from our earlier results [BCGS89] where we focused on models in which the unrestricted $\beta$ axiom holds.
		This would lead to a substantial difference between the operational semantics of the original term and the operational semantics of the translation in the case in which the evaluation of the expression $e$ diverges.
	www.cis.upenn.edu /~bcpierce/types/archives/1989/msg00082.html (1709 words)

	Simulation - Wikipedia, the free encyclopedia
		For example, Discrete Event Simulation is often used in industrial engineering, operations management and operational research to model many systems (commerce, health, defence, manufacturing, logistics, etc.) for example, the value-adding transformation processes in businesses, and optimize business performance.
		Since the operation of the computer is simulated, all of the information about the computer's operation is directly available to the programmer, and the speed and execution of the simulation can be varied at will.
		This is useful in the study of operational semantics.
	www.sciencedaily.com /encyclopedia/simulation (1631 words)

	Operational Semantics
		Operational semantics may be given to just about any kind of language behavior, but the rules do get more complicated.
		The only difference between the operational semantics and evaluator is the evaluator is a function, so we start with the bottom-left expression in a rule, use the evaluator to recursively produce the value(s) above the line in the rule, and finally compute and return the value below the line in the rule.
		This equivalence is known as operational equivalence because its definition is based on the interpreter for the language.
	www.cs.jhu.edu /~scott/pl/lectures/opsem.html (4030 words)

	COMP317: Operational Semantics
		When a semantics defines the meaning of expressions (whether these expressions be arithmetic expressions, Boolean expressions or programs) in terms of the meanings of their subexpressions, we say the semantics is compositional.
		The semantics as it stands doesn't say much about how programs are evaluated, in the sense that we simply have a relation (c,s) --> s' that tells us what the final state is after evaluating the program c - it doesn't say anything about the intermediate states that we pass through in evaluating the program.
		In the first operational semantics and in the one-step operational semantics, the evaluation of expressions does not change the state.
	www.csc.liv.ac.uk /~grant/Teaching/COMP317/opsem.html (3374 words)

	Higher Order Operational Techniques in Semantics - Contents
		These uses of operational semantics have arisen from a variety of research communities---for example, in concurrency theory, in functional programming, and in type theory---and some of the methods and techniques have emerged only recently.
		This paper presents applications of labelling to typed lambda calculi with fixed-point operators, including confluence and completeness of leftmost reduction for PCF (an "applied" lambda calculus with fixed-point operators and numeric and boolean operations) and a confluence proof for a variant of typed lambda calculus with subtyping.
		Techniques of operational semantics do not apply universally to all language varieties: techniques that work for simple functional languages may not apply to more realistic languages with features such as objects and memory effects.
	www.cl.cam.ac.uk /~amp12/hoots/Book/contents.html (1684 words)

	[sieber: denotational versus operational semantics]
		But that still doesn't mean that "operational semantics comes first", The simplest example for this view are typed lambda-terms.
		In other words, the intuitive ideas of ``functions'' and ``values'' are operational notions from the start---just vaguer than the precise rewrite rules which come later.
		I suspect that prior to both operational and semantical views are logical views.
	www.seas.upenn.edu /~sweirich/types/archive/1988/msg00058.html (328 words)

	2 Operational Semantics
		However, an operational semantics is more precise than an interpreter because it is defined mathematically, and not based on the meaning of the language in which the interpreter is written.
		An operational semantics for a programming language is a means for understanding in precise detail the meaning of an expression in the language.
		The only difference between the operational semantics and the interpreter is that the interpreter is a function, so we start with the bottom-left expression in a rule, use the interpreter to recursively produce the value(s) above the line in the rule, and finally compute and return the value below the line in the rule.
	www.cs.jhu.edu /~scott/plbook/book/html/mainch4.html (7098 words)

	Higher Order Operational Techniques in Semantics - Cambridge University Press
		Operational techniques are important because they are closer to implementations and language definitions than more abstract mathematical techniques such as denotational semantics.
		One of the exciting developments reflected by the book is that mathematical structures and techniques used in denotational semantics (such as fixpoint induction) may be recovered from a purely operational starting point.
		Operational reasoning for functional languages with local state A. Pitts, I. Stark; 7.
	www.cambridge.org /uk/catalogue/catalogue.asp?isbn=0521631688 (337 words)

	SOS 2005 Workshop
		A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics.
		Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes.
		Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages.
	www.cs.le.ac.uk /events/SOS2005 (507 words)

	CS655 - Problem Set 1: Operational Semantics
		Keep in mind that operational semantics are defined in terms of an abstract machine - the RVM has infinite memory and executes infinitely quickly.
		Don't worry if your operational semantics would be horribly inefficient or impractical if it were implemented on a concrete machine.
		Without defining the semantics, argue that it must be possible to define an operational semantics for PostFix using the RVM.
	www.cs.virginia.edu /~cs655/problem-sets/ps1.html (503 words)

	denotational versus operational semantics
		I can accept the viewpoint which Albert presented: The original semantic concepts might be vague, and rewrite rules are one possibility to make them precise.
		And that's difficult for call-by-name (try it with the example !), and much easier for call-by-value or -reference, because the SEMANTIC concepts 'value' and 'location' are simpler than 'thunk' (for name parameters).
		I think that the simplicity of the procedure call axiom was misleading in this case and that the denotational semantics reveals the difficulties which we have with call-by-name.
	www.cis.upenn.edu /~bcpierce/types/archives/1988/msg00066.html (474 words)

	A Typed Operational Semantics for Type Theory (Site not responding. Last check: )
		We introduce a new operational semantics, which we call typed operational semantics, which defines a reduction to normal form for terms which are well-typed in the type theory.
		The central result of the thesis is soundness of the typed operational semantics for the original system.
		We demonstrate that this equivalence between the declarative and operational presentations of type theory has important metatheoretic consequences: results such as strengthening, subject reduction and strong normalization follow by straightforward induction on derivations in the new system.
	www.seas.upenn.edu /~sweirich/types/archive/1994/msg00108.html (297 words)

	[No title]
		operational semantics of recursion A. adding recursion to the lambda calculus ------------------------------------------ RECURSION IN OPERATIONAL SEMANTICS OF THE \-CALCULUS Extended abstract syntax: M, N \in LambdaTerm I \in Identifier M ::= I
		Operational semantics summary A. good points of operational semantics what are some of the good points of operational semantics?
		B. problems with operational semantics what are some of the bad points of operational semantics?
	www.cs.iastate.edu /~leavens/ComS541Spring97/meeting-outlines/operational-semantics.txt (904 words)

	FMCAD 2004 - An Operational Semantics for Weak PSL (Site not responding. Last check: )
		In this paper, we argue that specifying an {\em operational semantics} may be helpful in guiding this work, and as a bonus leads to an implementation of the logic for free.
		We also propose a denotational semantics which we show to be equivalent to the operational one.
		This semantics is inspired by a new denotational semantics proposed in recent related work.
	www.cs.utexas.edu /users/hunt/FMCAD/2004/accepted/28.html (156 words)

	[No title]
		Benefits of Formal Semantics Programming language design hard- to-define= hard-to-implement=hard-to-use For example the Turing machine language semantics are easy to define, but to explain formally how C++ works is much harder.
		There are two types of operational semantics: Natural Operational Semantics Structural Operational Semantics Denotational Semantics In this semantic the meaning of the program is viewed as an input/output relation.
		The abstract (conservative) semantics of * is: *#PN?PPN?NNP????? Abstract (conservative) interpretation The goal of this analysis is to safely identify the sign of variables at every program location.
	www.math.tau.ac.il /~msagiv/courses/pa/operat.doc (1202 words)

	[No title]
		Using Operational semantics rule we get from that concrete state to other concrete state Using abstraction we get back from the new concrete state to a new abstract state.
		The abstract (conservative) semantics of * is: *#PN?PPN?NNP????? Abstract (conservative) interpretation Example - rule of signs(cont) The goal of this analysis is to safely identify the sign of variables at every program location.
		Conclusion The natural semantics cannot distinguish between looping and abnormal termination (unless the states are modified) In the structural operational semantics looping is reflected by infinite derivations and abnormal termination is reflected by stuck configuration The While Programming Language with Non-Determinism Abstract syntaxS::= x := a
	www.math.tau.ac.il /~msagiv/courses/pa/operation_semantics.doc (3027 words)

	Etymon
		In Operational semantics the meaning of a program is a transition function on a virtual machine.
		Now of course Interpreter Semantics is a whole different kettle of fish, and of course leaves you facing the 'turtle problem' - you can try for 'turtles all the way down' if you like, but once you hit the metal you've pretty much lost the point of a semantics in the first place.
		I'm naturally pleased to see this because storage, query, and management of semantics is precisely where projects like mulgara come in.
	etymon.blogspot.com (5569 words)

	An Operational Semantics for R5RS Scheme \| Lambda the Ultimate
		This paper presents an operational semantics for the core of Scheme.
		It is executable, because it is encoded as a program in PLT Redex, a domain-specific language for writing operational semantics.
		All are applicable to a wider range of problems than the specific uses we have for them, and the fact that they combine seamlessly in our full R5RS model shows that they scale to real languages.
	lambda-the-ultimate.org /node/view/971 (320 words)

	Operational Semantics (Site not responding. Last check: )
		One style of formally describing the semantics of a language.
		Conclusions implied by zero premises are axioms of that language's semantics.
		To describe the meaning of a program, we first need to establish some notion of what it means for a program to mean something.
	www.cs.fiu.edu /~yehd/cop4555/simp.htm (345 words)

	Implementation of operational semantics (Site not responding. Last check: )
		For use on undergraduate courses, I developed a system to compile operational semantics.
		After compiling the semantics, the user can get the computer to derive proofs within the semantics.
		The notation is based on the,,The Semantics of Programming Languages - An Elementary Introduction using Operational Semantics” by Hennessy.
	www.linearity.org /turtle/reports/neergaard-impl-op-sem.html (150 words)

Try your search on: Qwika (all wikis)