|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc010402,
author = {Silvia Ghilezan},
title = {Generalized Finiteness of Developments in Typed Lambda Calculi},
journal = jalc,
year = 1996,
volume = 1,
number = 4,
pages = {247--257},
keywords = {reduction, lambda calculus},
abstract = {The strong normalization property of the intersection type
assignment system is used in order to prove the finiteness
of developments property of the untyped lambda calculus
by Krivine. 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.}
}