Authors: Ghilezan, Silvia 
Title: Generalized finiteness of developments
Journal: Journal of Automata, Languages and Combinatorics
First page: 247
Last page: 257
Issue Date: 1996
ISSN: 1430-189X
DOI: 10.25596/jalc-1996-247
The strong normalization property of the intersection type assignment system is used in
order to prove the finiteness οί developments property of the untyped lambda calculus
in [6]. Similarly, the strong normalization property of the simply typed lambda calculus
can be used for the same reason. We extend both of these methods in order to prove
the generalized finiteness of developments.
Keywords: reduction | lambda calculus
Publisher: Institut für Informatik, Justus-Liebig-Universität Giessen, Germany

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.