Parametricity and Proving Free Theorems for Functional-Logic Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Parametricity and Proving Free Theorems for Functional-Logic Languages


The goal of this paper is to provide the required foundations forestablishing free theorems – statements about program equivalence,guaranteed by polymorphic types – for the functional-logic pro-gramming language Curry. For the sake of presentation we restrictourselves to a language fragment that we call CuMin, and that hasthe characteristic features of Curry (both functional and logic). Wepresent a new denotational semantics based on partially ordered setswithout limits. We then introduce an intermediate language calledSaLT that is essentially a lambda-calculus extended with an abstractset type, and again give a denotational semantics. We show that thestandard (logical relations) techniques can be applied to obtain ageneral parametricity theorem for SaLT and derive free theoremsfrom it. Via a translation from CuMin to SaLT that fits the respectivesemantics, we then derive free theorems for CuMin.
Fichier principal
Vignette du fichier
ppdp2014-final.pdf (304.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01092357 , version 1 (18-12-2014)



Stefan Mehner, Daniel Seidel, Lutz Strassburger, Janis Voigtländer. Parametricity and Proving Free Theorems for Functional-Logic Languages. Principles and Practice of Declarative Programming, PPDP 2014, Sep 2014, Canterbury, United Kingdom. ⟨10.1145/2643135.2643147⟩. ⟨hal-01092357⟩
394 View
256 Download



Gmail Facebook Twitter LinkedIn More