|
Assaf J. Kfoury
Beta-reduction as unification
In D. Niwinski, editor, Logic, Algebra, and Computer Science (H.
Rasiowa Memorial Conference, December 1996), Banach Center Publication,
Volume 46, pages 137-158 Springer-Verlag, 1999
Supersedes [92] but omits a few proofs included
in the latter
We define a new unification problem, which we call
beta-unification and which can be used to characterize
the beta-strong normalization of terms in the
lambda-calculus. We prove the undecidability
of beta-unification, its connection with the system
of intersection types, and several of its basic
properties.
[ bib |
.ps.gz |
.pdf.gz |
.pdf |
.html ]
Back
This file has been generated by
bibtex2html 1.61
Copyright notice: The documents contained
in these pages are included by the contributing authors as a means to
ensure timely dissemination of scholarly and technical work on a
non-commercial basis. Copyright and all rights therein are maintained
by the authors or by other copyright holders, notwithstanding that
they have offered their works here electronically. It is understood that all persons copying this information will
adhere to the terms and constraints invoked by each author's
copyright. These works
may not be reposted without the explicit permission of the copyright
holder.
If you experience problems downloading any of the files above,
it is most likely because your browser does not handle compressed
files correctly.
In particular, Netscape might save the file in the compressed
gz-format with extension .ps or
.pdf (indicating postscript or PDF, resp.). You can work around this by saving the file,
renaming it to .ps.gz or .pdf.gz, and then
uncrompress it.
|
