Describing lambda terms in context unification

Authors:
Joachim Niehren;Mateu Villaret
Affiliations:
INRIA Futurs, Lille, France;IMA, Universitat de Girona, Girona, Spain
Venue:
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Year:
2005

Citing 17
Cited 1

Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
A decision algorithm for distributive unification

Theoretical Computer Science - Special issue on rewriting techniques and applications
On the undecidability of second-order unification

Information and Computation - Special issue on RTA-98
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Dominance Constraints in Context Unification

LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Completion of Rewrite Systems with Membership Constraints

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Parallelism Constraints

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Context Unification and Traversal Equations

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidability of Bounded Higher-Order Unification

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Solvability of Context Equations with Two Context Variables is Decidable

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Parallelism and Tree Regular Constraints

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Well-nested parallelism constraints for ellipsis resolution

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Underspecified beta reduction

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Bridging the gap between underspecification formalisms: minimal recursion semantics as dominance constraints

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

On the relation between Context and Sequence Unification

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.