A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables - Archive ouverte HAL Access content directly
Other Publications Year : 2009

A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables

Abstract

We formally specified the type system and operational semantics of Loopω with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of Loopω have been tested using Isabelle/HOL program extraction facility for inductively defined relations. In particular, the program that computes the Ackermann function type checks and behaves as expected. The main difference (apart from the choice of an Ada-like concrete syntax) with Loopω comes from the treatment of parameter passing. Indeed, since Ott does not currently fully support α-conversion, we rephrased the operational semantics with explicit aliasing in order to implement the out parameter passing mode.
Fichier principal
Vignette du fichier
TR-LACL-2009-3.pdf (1.38 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00385416 , version 1 (19-05-2009)

Identifiers

  • HAL Id : hal-00385416 , version 1

Cite

Tristan Crolard, Emmanuel Polonowski. A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables. 2009. ⟨hal-00385416⟩

Collections

CNRS LACL UPEC
79 View
35 Download

Share

Gmail Facebook X LinkedIn More