Terminating Type System in Iris
Date: Wed, March 06, 2019
Logical relations have been used to certify the soundness of languages and type systems. Iris offers an suitable framework for this approach, where it was used to give guarantees about Rust. During my internship, I focused on another major property, termination, and wanted see if Iris could be used to reason about termination. In this talk I will present my main result: a termination proof, in Iris, for a language with recursive types and references. I will also discuss possible future work, mainly in the direction of modularity.
Neil Yorke-Smith | The Constraint Programming Language MiniZinc
Next: | Scopes as Types