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.
https://hal.inria.fr/inria-00000817
Contributor : Benjamin Wack <>
Submitted on : Monday, December 12, 2005 - 3:59:40 PM Last modification on : Monday, October 12, 2020 - 10:30:12 AM Long-term archiving on: : Friday, April 2, 2010 - 7:49:02 PM
Horatiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack. Decidable Type Inference for the Polymorphic Rewriting Calculus. 17è Journées Francophones des Langages Applicatifs - JFLA 2006, Jan 2006, Pauillac, France. pp.57-69. ⟨inria-00000817⟩