Decidable Type Inference for the Polymorphic Rewriting CalculusReportar como inadecuado




Decidable Type Inference for the Polymorphic Rewriting Calculus - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 PROTHEO - Constraints, automatic deduction and software properties proofs INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications 2 LOGNET - Logical Networks: Self-organizing Overlay Networks and Programmable Overlay Computing Systems CRISAM - Inria Sophia Antipolis - Méditerranée 3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués

Abstract : The rewriting calculus is a minimal framework embedding lambda calculus and term rewriting systems that allows abstraction on variables and patterns. The rewriting calculus features higher-order functions from the lambda calculus and pattern matching from term rewriting systems. In this paper, we study extensively the decidability of type inference in the second-order rewriting calculus à la Curry.





Autor: Horatiu Cirstea - Claude Kirchner - Luigi Liquori - Benjamin Wack -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados