From Operational to Denotational Semantics

@inproceedings{Smith1991FromOT,
  title={From Operational to Denotational Semantics},
  author={Scott F. Smith},
  booktitle={MFPS},
  year={1991}
}
In this paper operational equivalence of simple functional programs is defined, and certain basic theorems proved thereupon. These basic theorems include congruence, least fixed-point, an analogue to continuity, and fixed-point induction. We then show how any ordering on programs for which these theorems hold can be easily extended to give a fully abstract cpo for the language, giving evidence that any operational semantics with these basic theorems proven is complete with respect to a… 

From Operational Semantics to Domain TheoryIan

This paper builds domain theoretic concepts upon an operational foundation. The basic operational theory consists of a single step reduction system from which an operational ordering and equivalence

From Operational Semantics to Domain Theory

TLDR
domain theoretic concepts are extended to include concepts from domain theory, including the notions of directed set, least upper bound, complete partial order, monotonicity, continuity, finite element,?-algebraicity, full abstraction, and least fixed point properties, and are used to construct a (strongly) fully abstract continuous model for the authors' language.

CPO Models for Compact GSOS Languages

In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail, and Meyer. The

Full Abstraction and the Context Lemma

TLDR
A general notion of rewriting system of the kind used for evaluating simply typed l-terms in Scott''s PCF is defined, showing that any denotational semantics that is adequate for PCF cannot be fully abstract for any extension of PCF satisfying the Context Lemma.

Full Abstraction and the Context Lemma 1

TLDR
A general notion of rewriting system of the kind used for evaluating simply typed -terms in Scott's PCF is presented, showing that any denotational semantics that is adequate for PCF cannot be fully abstract for any extension of PCF satisfying the Context Lemma.

From SOS rules to proof principles: an operational metatheory for functional languages

TLDR
This paper defines a rule format, Globally Deterministic SOS (GDSOS), and establishes some proof principles for reasoning about equivalence which are sound for all languages which can be expressed in this format.

CPO Models for GSOS Languages - Part I: Compact GSOS Languages

TLDR
This paper presents a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer, and gets several general results on the bisimulation preorder.

A Lambda-Calculus with letrec, case, constructors and non-determinism

TLDR
This shows that the combination of a context lemma and a meta-rewriting on reductions using complete sets of commuting (forking, resp.) diagrams is a useful and successful method for providing a semantics of a functional programming language and proving correctness of program transformations.

Reasoning about local variables with operationally-based logical relations

  • A. Pitts
  • Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
TLDR
A parametric logical relation between the phrases of an Algol-like language is presented and provides an applicative characterisation of contextual equivalence for the language and provides a useful (and complete) method for proving equivalences.

Structural Operational Semantics

TLDR
The importance of giving precise semantics to programming and specification languages was recognized since the sixties with the development of the first high-level programming languages and was already advocated by McCarthy in [147], and elaborated upon in references like [142, 143].

References

SHOWING 1-10 OF 26 REFERENCES

Admissibility of fixed-point induction in first- order logic of typed theories

  • S. Igarashi
  • Computer Science
    International Sympoisum on Theoretical Programming
  • 1972
TLDR
First-order logic is extended so as to deal with typed theories, especially that of continuous functions with fixed-point induction formalized by D. Scott, so that one may characterize formulas for which Scott-type induction is applicable in terms of syntax which can be checked by machines automatically.

Equality in lazy computation systems

  • Douglas J. Howe
  • Mathematics
    [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
TLDR
The author proves that if an extensionality condition holds of each of the operators of a computational system, then the equivalence relation is a congruence, so that the usual kinds of equality reasoning are valid for it.

LCF Considered as a Programming Language

Can LCF be topped? Flat lattice models of typed lambda calculus

  • B. Bloom
  • Computer Science
    [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
  • 1988

Equivalence in functional languages with effects

TLDR
Adding objects with memory to the call-by-value lambda calculus results in a language with a rich equational theory, satisfying many of the usual laws, providing evidence that expressive, mathematically clean programming languages are indeed possible.

Programming and proving with function and control abstractions

TLDR
This paper focuses on programming and proving with function and control abstractions and presents a variety of example programs, properties, and techniques for proving these properties.

Programming, Transforming, and Providing with Function Abstractions and Memories

TLDR
A study of operational approximation and equivalence in the presence of function abstractions and objects with memory and an informal summary of the results illustrating properties of operational ICALP 89 is presented.

Call-by-Name, Call-by-Value and the lambda-Calculus

Mathematical Theory of Computation

TLDR
The goals of this project were the development of logical formalisms for reasoning about programs that use abstractions and reflection, and the application of these theoretical results to selected software problems.