Beta reduction constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2051 LNCS, Issue , 2001, Pages 31-46

  Bodirsky, Manuel ^a   Erk, Katrin ^a   Koller, Alexander ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BETA-REDUCTION; CONSTRAINT LANGUAGE; LAMBDA TERMS; SEMI-DECISION PROCEDURES;

ARTIFICIAL INTELLIGENCE;

EID: 84888209444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_5     Document Type: Conference Paper

References (17)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. J. Logic, Language, and Information, 4(1):5-39, 1995.
3. M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Beta reduction constraints, 2001. Full version. http://www.ps.uni-sb.de/Papers/abstracts/beta. html.
4. M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Underspecified beta reduction, 2001. Submitted. http://www.ps.uni-sb.de/Papers/abstracts/usp-beta. html.
5. D. Duchier and J. Niehren. Dominance constraints with set operators. In First International Conference on Computational Logic (CL2000), LNCS, July 2000.
6. M. Egg, A. Koller, and J. Niehren. The Constraint Language for Lambda Structures. Journal of Logic, Language, and Information, 2001. To appear.
7. M. Egg, J. Niehren, P. Ruhrberg, and F. Xu. Constraints over lambda-structures in semantic underspecification. In In Proceedings COLING/ACL'98, 1998.
8. K. Erk, A. Koller, and J. Niehren. Processing underspecified semantic descriptions in CLLS. Journal of Language & Computation, 2001. To appear.
9. K. Erk and J. Niehren. Parallelism constraints. In Int. Conference on Rewriting Techniques and Applications, volume 1833 of LNCS, pages 110-126, 2000.
10. G. P. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
11. J. Lamping. An algorithm for optimal lambda calculus reduction. In ACM Symposium on Principles of Programming Languages, pages 16-30, 1990.
12. J. Lévy. Linear second order unification. In 7th Int. Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332-346, 1996.
13. M. P. Marcus, D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129-136, 1983.
14. M. Pinkal. Radical underspecification. In Proc. 10th Amsterdam Colloquium, 1996.
15. U. Reyle. Dealing with ambiguities by underspecification: construction, representation, and deduction. Journal of Semantics, 10:123-179, 1993.
16. M. Schmidt-Schauß and K. Schulz. Solvability of context equations with two context variables is decidable. In Int. Conf. on Automated Deduction, LNCS, 1999.
17. K. van Deemter and S. Peters. Semantic Ambiguity and Underspecification. CSLI Press, Stanford, 1996.