@inproceedings{4cf33ac1d0b04aa597dda6592285d2a5,
title = "Describing lambda terms in context unification",
abstract = "The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLLS provides parallelism constraints to talk about the tree structure of lambda terms, and lambda binding constraints to specify variable binding. Parallelism constraints alone have the same expressiveness as context unification. In this paper, we show that lambda binding constraints can also be expressed in context unification when permitting tree regular constraints.",
keywords = "Computational linguistics, Dominance constraints, Second-order unification, Underspecified semantics",
author = "Joachim Niehren and Mateu Villaret",
year = "2005",
doi = "10.1007/11422532\_15",
language = "English",
isbn = "3540257837",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "221--237",
booktitle = "Logical Aspects of Computational Linguistics - 5th International Conference, LACL 2005, Proceedings",
address = "Germany",
note = "5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005 ; Conference date: 28-04-2005 Through 30-04-2005",
}