Winskel is (almost) Right: Towards a Mechanized Semantics Textbook

We present a formalization of the first 100 pages of Winskel's textbook The Formal Semantics of Programming Languages in the theorem prover Isabelle/HOL: 2 operational, 2 denotational, 2 axiomatic semantics, a verification condition generator, and the necessary soundness, completeness and equiv...

Full description

Saved in:
Bibliographic Details
Published in:Formal aspects of computing Vol. 10; no. 2; pp. 171 - 186
Main Author: Nipkow, Tobias
Format: Journal Article
Language:English
Published: London Springer-Verlag London Limited 01.11.1998
Springer
Subjects:
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
General logic
Language theory and syntactical analysis
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Programming languages
Sciences and techniques of general use
Software
Software and its engineering
Software and its engineering / Software notations and tools
Software and its engineering / Software notations and tools / Formal language definitions
Software and its engineering / Software notations and tools / General programming languages
Theoretical computing
Theory of computation
Theory of computation / Logic
Theory of computation / Logic / Proof theory
Theory of computation / Semantics and reasoning
Theory of computation / Semantics and reasoning / Program reasoning
Theory of computation / Semantics and reasoning / Program semantics
Keywords: Semantics; Programming language; Theorem proving; Higher-order logic; HOL; Isabelle
Formal language
Language theory
Programming language
Denotational semantics
Axiomatic theory
Formal semantics
Programming theory
ISSN:0934-5043, 1433-299X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a formalization of the first 100 pages of Winskel's textbook The Formal Semantics of Programming Languages in the theorem prover Isabelle/HOL: 2 operational, 2 denotational, 2 axiomatic semantics, a verification condition generator, and the necessary soundness, completeness and equivalence proofs, all for a simple imperative programming language.
ISSN:0934-5043
1433-299X
DOI:10.1007/s001650050009