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.
Document type :
Other publications
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00385416
Contributor : Emmanuel Polonowski <>
Submitted on : Tuesday, May 19, 2009 - 11:21:43 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM
Document(s) archivé(s) le : Thursday, June 10, 2010 - 11:24:53 PM

File

TR-LACL-2009-3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00385416, version 1

Collections

Citation

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

Share

Metrics

Record views

125

Files downloads

44