A Semi-Syntactic Soundness Proof for HM(X) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

A Semi-Syntactic Soundness Proof for HM(X)


This document gives a soundness proof for the generic constraint-based type inference framework HM(X). Our proof is semi-syntactic. It consists in two steps. The first step is to define a ground type system, where polymorphism is extensional, and prove its correctness in a syntactic way. The second step is to interpret HM(X) judgements as (sets of) judgements in the underlying system, which gives a logical view of polymorphism and constraints. Overall, the approach may be seen as more modular than a purely syntactic approach: because polymorphism and constraints are dealt with separately, they do not clutter the subject reduction proof. However, it yields a slightly weaker result: it only establishes type soundness, rather than subject reduction, for HM(X).


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4150.pdf (221.31 Ko) Télécharger le fichier

Dates and versions

inria-00072475 , version 1 (24-05-2006)


  • HAL Id : inria-00072475 , version 1


François Pottier. A Semi-Syntactic Soundness Proof for HM(X). [Research Report] RR-4150, INRIA. 2001. ⟨inria-00072475⟩
101 View
39820 Download


Gmail Facebook Twitter LinkedIn More