From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages

From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages (1997)

Cached

Download Links

[www.cs.chalmers.se]

Other Repositories/Bibliography

DBLP

by David Sands

Venue:	In Proc. POPL'97, the 24 th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Citations:	17 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages	user correction - Legacy Corrections
AUTHOR NAME	David Sands	SVM HeaderParse 0.1
AUTHOR AFFIL	; 1	SVM HeaderParse 0.2
AUTHOR ADDR	; Sweden	SVM HeaderParse 0.1
ABSTRACT	Structural Operational Semantics (SOS) is a widely used formalism for specifying the computational meaning of programs, and is commonly used in specifying the semantics of functional languages. Despite this widespread use there has been relatively little work on the imetatheoryj for such semantics. As a consequence the operational approach to reasoning is considered ad hoc since the same basic proof techniques and reasoning tools are reestablished over and over, once for each operational semantics speciøcation. This paper develops some metatheory for a certain class of SOS language speciøcations for functional languages. We deøne a rule format, Globally Deterministic SOS (gdsos), and establish some proof principles for reasoning about equivalence which are sound for all languages which can be expressed in this format. More speciøcally, if the SOS rules for the operators of a language conform to the syntax of the gdsos format, then ffl a syntactic analogy of continuity holds, which rel...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	In Proc. POPL'97, the 24 th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	428--441	INFERENCE
CITATIONS	38 found	ParsCit 1.0