Resumption-based big-step and small-step interpreters for While with interactive I/O

@inproceedings{Nakata2011ResumptionbasedBA,
  title={Resumption-based big-step and small-step interpreters for While with interactive I/O},
  author={Keiko Nakata},
  booktitle={DSL},
  year={2011}
}
  • Keiko Nakata
  • Published in DSL 1 September 2011
  • Computer Science
In this tutorial, we program big-step and small-step total interpreters for the While language extended with input and output primitives. While is a simple imperative language consisting of skip, assignment, sequence, conditional and loop. We first develop trace-based interpreters for While. Traces are potentially infinite nonempty sequences of states. The interpreters assign traces to While programs: for us, traces are denotations of While programs. The trace is finite if the program is… 

Completely iterative monads in semantics of coinductive programs

The thesis of this dissertation is that the right kind of monads to describe the observable behaviour of programs are completely iterative monads (cims), introduced by Elgot and more recently studied by Adamek and others.

A Metalanguage for Guarded Iteration

Denotational Semantics of A User-Oriented, Domain-Specific Language

This paper presents the formal definition of a domain-specific language, named Pantagruel, following the methodology proposed by David Schmidt for language development and shows how the user-oriented programming concepts of Pantgruel are expressed in the denotational semantics of Pantgeruel.

References

SHOWING 1-10 OF 19 REFERENCES

Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction

Several big-step semantics for Whil e with interactive I/O are defined, based on resumptions and termination-sensitive weak bisimilarity, which require nesting inductive definitions in coinductive definitions, which is interesting both matically and from the point-of-view of implementation in a proof assistant.

Trace-Based Coinductive Operational Semantics for While Big-Step and Small-Step, Relational and Functional Styles

Four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs are presented and their equivalence proofs are formalized in the constructive setting of Coq.

A constructive denotational semantics for Kahn networks in Coq

A general library for cpos, an interpretation of (deterministic) parallel programs (now called Kahn networks) as stream transformers based on the theory of complete partial orders (cpos), and a formalization of this seminal paper in the Coq proof assistant.

Trace-Based Coinductive Operational Semantics for While

Four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs are presented and their equivalence proofs are formalized in the constructive setting of Coq.

General recursion via coinductive types

This work shows how a simple device is sufficient to formalize all recursive functions between two given types, and allows the definition of fixed points of finitary, that is, continuous, operators.

Some Domain Theory and Denotational Semantics in Coq

A Coq formalization of constructive *** -cpos up to and including the inverse-limit construction of solutions to mixed-variance recursive domain equations, and the existence of invariant relations on those solutions, is presented.

Generic Trace Semantics via Coinduction

The application field of coalgebras is extended, providing a new instance of the principle "process semantics via coinduction" of bisimilarity, namely coinductions in a Kleisli category.

A note on coinduction and weak bisimilarity for while programs

  • J. Rutten
  • Economics
    RAIRO Theor. Informatics Appl.
  • 1999
An illustration of coinduction in terms of a notion of weak bisimilarity is presented, which identifies any two programs that are weakly bisimilar, and induces in a canonical manner a compositional model D.

A Syntactic Approach to Modularity in Denotational Semantics

A syntactic reformulation of the modular approach to Denotational Semantics in Mog89a is proposed, based on a duality between model constructions and translations of theories (often called relative interpretations), analogous to Gabriel-Ulmer duality.

Acknowledgments The author's research was supported by the European Regional Development Fund (ERDF) through the Estonian Centre of Excellence in Computer Science (EXCS)

  • Acknowledgments The author's research was supported by the European Regional Development Fund (ERDF) through the Estonian Centre of Excellence in Computer Science (EXCS)