Beta Reduction Constraints

Manuel Bodirsky 1 Katrin Erk 1 Alexander Koller 2 Joachim Niehren 1
1 Programming Systems Lab [Saarland]
2 Allgemeine Linguistik - Allgemeine Linguistik Computational Linguistics and phonetics
Abstract : The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.
Type de document :
Communication dans un congrès
Aart Middeldorp. International Conference on Rewriting Techniques and Applications, 2001, Utrecht, Netherlands. Springer-Verlag, Berlin, pp.31-46, 2001, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/inria-00536804
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:09:22
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:13:37

Fichiers

beta.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536804, version 1

Citation

Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Beta Reduction Constraints. Aart Middeldorp. International Conference on Rewriting Techniques and Applications, 2001, Utrecht, Netherlands. Springer-Verlag, Berlin, pp.31-46, 2001, Lecture Notes in Computer Science. 〈inria-00536804〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

65

Téléchargements de fichiers

86

Contact


archive-ouverte@inria.fr