Abstract
The expansion postponement problem in Pure Type Systems is an open problem raised by R. Pollack in 1992. In this paper, the author presents a set of necessary and sufficient conditions for this problem and a set of sufficient conditions for it. The author also gives some properties for pure type systems without the expansion rule.
Similar content being viewed by others
References
Barendregt H P. Introduction to generalized type systems.J. Functional Programming, 1991, 1(2): 124–154.
Pollack R. Typechecking in pure type systems. In1992 Workship on Types for Proofs and Programs, Baastad, Sweden, 1992, pp.271–288.
van Benthem Jutting L Set al. Checking Algorithms for Pure Type System. 1993.
Barendregt H P. Lambda calculi with types. InHandbook of Logic in Computer Science, Vol II, Gabbai Abramsky, Maibaum (eds.), Oxford University Press, 1992.
Author information
Authors and Affiliations
Additional information
Song Fangmin is an Associate Professor of the Department of Computer Science, Nanjing University. He received his B.S., M.S. and Ph.D. degress from Nanjing University in 1982, 1985 and 1988 respectively. His research interests, include logic in computer science, lambda calculus and type theory.
Rights and permissions
About this article
Cite this article
Song, F. The expansion postponement in Pure Type Systems. J. of Comput. Sci. & Technol. 12, 555–563 (1997). https://doi.org/10.1007/BF02947207
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02947207