Computer Science – Logic in Computer Science
Scientific paper
2009-10-06
Computer Science
Logic in Computer Science
Scientific paper
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.
Crolard Tristan
Polonowski Emmanuel
No associations
LandOfFree
A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-357802