Abstract
We present a type inference procedure with partial types for a λ-calculus equipped withda tatypes. Our procedure handles a type language containing greatest and least types (ω and ⊥ respectively), recursive types, subtyping, and datatypes (yielding constants at the level of terms). The main feature of our algorithm is incrementality; this allows us to progressively analyse successive de.nitions, which is of interest in the setting of a system like the CuCh machine (developed at the University of Rome). The methods we describe have led to an implementation; we illustrate its use on a few examples.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575–631, 1993.
Z. M. Ariola and J. W. Klop. Equational term graphrewrit ing. Technical report, University of Oregon, 1995.
H. Abelson and G. J. Susman. Structure and Interpretation of Computer Programs. MIT Press, 1985.
C. Böhm and A. Berarducci. Automatic Synthesis of Typed λ-programs on Term Algebras. Theoretical Computer Science, 39:135–154, 1985.
H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931–940, 1983.
M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticæ, 33:309–338, 1998.
C. Böhm, A. Piperno, and S. Guerrini. Lambda-definition of Function(al)s by Normal Forms. In Proc. of ESOP’94, volume 788 of LNCS, pages 135–154. Springer Verlag, 1994.
F. Cardone and M. Coppo. Two Extensions of Curry’s Inference System. In P. Odifreddi, editor, Logic and Computer Science, pages 19–75. Accademic Press, 1990.
F. Cardone and M. Coppo. Type inference withr ecursive types. Syntax and Semantics. Information and Computation, 92(1):48–80, 1991.
C. Gomard. Partial Type Inference for Untyped Functional Programs. In Proceedings of the ACM Conference on Lisp and Functional Programming, pages 282–287, 1990.
T. Jim. What are principal typings and what are they good for? In POPL’96, pages 42–53. ACM, 1996.
D. Kozen, J. Palsberg, and M. I. Schwartzbach. Efficient inference of partial types. Journal of Computer and System Sciences, 49(2):306–324, 1994. also in Proceedings of FOCS’92, pages 363–371.
R. Milner. A Theory of Type Polimorphism in Programming. Journal of Computer and System Sciences, 17:348–375, 1978.
S. Thatte. Type inference with partial types. TCS, 124:127–148, 1994. also in Proceedings of ICALP’ 88, pages 615–629.
Mitchell Wand and Patrick M. O’Keefe. Type inference for partial types is decidable. In B. Krieg-Brückner, editor, European Symposium on Programming’ 92, volume 582 of LNCS, pages 408–417. Springer Verlag, 1992.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppo, M., Hirschkoff, D. (2001). Incremental Inference of Partial Types. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive