A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables
Logic in Computer Science
2009-10-07 v1
Abstract
We formally specified the type system and operational semantics of LOOPw with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of LOOPw 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 LOOPw comes from the treatment of parameter passing. Indeed, since Ott does not currently fully support alpha-conversion, we rephrased the operational semantics with explicit aliasing in order to implement the out parameter passing mode.
Keywords
Cite
@article{arxiv.0910.1020,
title = {A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables},
author = {Tristan Crolard and Emmanuel Polonowski},
journal= {arXiv preprint arXiv:0910.1020},
year = {2009}
}