Abstract not found

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.

1 Interprétation calculatoire de la logique soustractive..................... 7 1.1 Présentation du premier article..................................... 7 1.2 À propos des systèmes avec relations de dépendance...................... 13 1.3 Logique à domaine constant et arithmétique............................ 14

• How do you prove the correctness of this program from [Wadler, 1994]? let g = (reset (if (shift λf.f) then 2 else 3)) in (g True) + (g False)

Certification de programmes impératifs d’ordre supérieur avec mécanismes de contrôle