Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study

Abstract

This paper presents a case study of formalizing a normalization proof for Leivant's Predicative System F using the Equations package. Leivant's Predicative System F is a stratified version of System F, where type quantification is annotated with kinds representing universe levels. A weaker variant of this system was studied by Stump & Eades, employing the hereditary substitution method to show normalization. We improve on this result by showing normalization for Leivant's original system using hereditary substitutions and a novel multiset ordering on types. Our development is done in the Coq proof assistant using the Equations package, which provides an interface to define dependently-typed programs with well-founded recursion and full dependent pattern-matching. Equations allows us to define explicitly the hereditary substitution function, clarifying its algorithmic behavior in presence of term and type substitutions. From this definition, consistency can easily be derived. The algorithmic nature of our development is crucial to reflect languages with type quantification, enlarging the class of languages on which reflection methods can be used in the proof assistant.

Dates and versions

hal-01248807 , version 1 (28-12-2015)

Identifiers

Cite

Cyprien Mangin, Matthieu Sozeau. Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study. Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice, Aug 2015, Berlin, Germany. ⟨10.4204/EPTCS.185.5⟩. ⟨hal-01248807⟩
66 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More