Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
< Leer menos
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
17th International Conference on Rewriting Techniques and Applications, RTA 2006, 2006, Seattle. 2006, vol. LNCS 4098, p. 151-165
Springer-Verlag
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Palabras clave en inglés
linear lambda-calculus
higher-order matching
type theory
Orígen
Importado de HalCentros de investigación