Big-step Operational Semantics Revisited

Authors:
JarosłAw Dominik Mateusz Kuśmierek;Viviana Bono
Affiliations:
(Correspd.) Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. jdk@google.com;Department of Computer Science, Torino University, Italy. bono@di.unito.it
Venue:
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Year:
2010

Citing 7
Cited 2

Natural semantics

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Classes and mixins

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
More dynamic object reclassification: Fickle∥

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Theory of Objects

A Theory of Objects
The Definition of Standard ML

The Definition of Standard ML
A lambda calculus of objects and method specialization

Nordic Journal of Computing
From natural semantics to abstract machines

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation

Coinductive big-step operational semantics for type soundness of Java-like languages

Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs
Soundness of object-oriented languages with coinductive big-step semantics

ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel approach to big-step operational semantics. This approach stems from the observation that the typical type soundness property formulated via a big-step operational semantics is weak, while the option of using a small-step operational semantics is not always an option, because it is less intuitive to build and understand. We support our claim by using a simple language called LM, for which we present a big-step semantics expressed with the new approach, allowing one to formulate a stronger type soundness property. We prove this property for LM and we present an example of an error in the typing rules which does not violate the typical type soundness property, but does violate ours.