Skip to Main content Skip to Navigation
Conference papers

Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.

Sylvain Salvati 1
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : We introduce syntactic descriptions, an extended type sys- tem for the linear lambda-calculus. With this type system checking that a linear lambda-term normalizes to another one reduces to type-checking. As a consequence this type system can be seen as a formal tool to design matching algorithms. In that respect, solving matching equations becomes a combination of type inference and proof search. We present such an algorithm for linear matching equations.In the case of second order equations, this algorithm stresses the similarities between linear matching in the linear lambda-calculus and linear context matching. It uses tabular techniques and is a practical alternative to Huet's algorithm for those equations.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Salvati <>
Submitted on : Friday, October 24, 2008 - 2:21:02 PM
Last modification on : Thursday, February 11, 2021 - 2:52:01 PM


  • HAL Id : inria-00334006, version 1



Sylvain Salvati. Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.. 17th International Conference on Rewriting Techniques and Applications, RTA 2006, 2006, Seattle, United States. pp.151-165. ⟨inria-00334006⟩



Record views