The Polymorphic Rewriting Calculus: Type checking vs. Type inference - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

The Polymorphic Rewriting Calculus: Type checking vs. Type inference

Résumé

The rewriting calculus (rho-calculus), is a minimal framework embedding lambda-calculus and term rewriting systems, by allowing abstraction on variables and patterns. The rho-calculus features higher-order functions (from lambda-calculus) and pattern-matching (from term rewriting systems). In this paper, we study extensively a second-order rho-calculus à la Church (Rho F) that enjoys subject reduction, type uniqueness and decidability of typing. Then we apply a classical type-erasing function to rho 2, to obtain an untyped rho-calculus à la Curry (uRho F). The related type inference system is isomorphic to Rho F and enjoys subject reduction. Both Rho F and uRho F systems can be considered as minimal calculi for polymorphic rewriting-based programming languages. We discuss the possibility of a logic existing underneath the type systems via a Curry-Howard Isomorphism.
Fichier principal
Vignette du fichier
2005-wrla-04.pdf (412.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00099910 , version 1 (07-05-2015)

Identifiants

Citer

Luigi Liquori, Benjamin Wack. The Polymorphic Rewriting Calculus: Type checking vs. Type inference. Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004, Narciso Marti-Oliet, Mar 2004, Barcelona, Spain. pp.89-111, ⟨10.1016/j.entcs.2004.06.027⟩. ⟨inria-00099910⟩
148 Consultations
81 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More