This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Boutin. Preuve de correction de la compilation de mini-ml en code cam dans le système d'aide à la démonstration coq. Technical Report 2536, INRIA, Apr. 1995.
R. Burstall, D. MacQueen, and D. Sannella. Hope: an experimental applicative language. In Proc. 1980 LISP Conference, pages 136–143, 1980.
D. Clément, J. Despeyroux, T. Despeyroux, and G. Kahn. A simple applicative language: Mini-ML. In Proc. ACM Conf. Lisp and Functional Programming, pages 13–27, 1986.
L. Damas and R. Milner. Principal type schemes for functional programs. In Proc. 9th ACM Symp. Principles of Programming Languages, pages 207–212, 1982.
L. M. M. Damas. Type Assignment in Programming Languages. PhD thesis, Department of Computer Science, University of Edinburgh, 1985.
N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34:381–392, 1972.
C. Dubois and V. Ménissier-Morain. A proved type inference tool for ML: Damas-Milner within Coq (work in progress). In J. von Wright, J. Grundy, and J. Harrison, editors, Supplementary Proc. 9th Int. Conf. Theorem Proving in Higher Order Logics, pages 15–30. Turku Centre for Comp. Sci., 1996.
M. Gordon and T. Melham. Introduction to HOL: a theorem-proving environment for higher order logic. Cambridge University Press, 1993.
J. Hannan and F. Pfenning. Compiler verification in LF. In 7th IEEE Symp. Logic in Computer Science, pages 407–418. IEEE Computer Society Press, 1992.
J.R. Hindley. The principal type-scheme of an object in combinatory logic. Trans. AMS, 146:29–60, 1969.
P. Hudak, S. Peyton Jones, and P. Wadler. Report on the programming language Haskell: A non-strict, purely functional language. ACM SIGPLAN Notices, 27(5), May 1992. Version 1.2.
J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lect. Notes in Comp. Sci., pages 289–305. Springer-Verlag, 1993.
R. Milner. A theory of type polymorphism in programming. J. Comp. Sys. Sci., 17:348–375, 1978.
R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.
D. Nazareth and T. Nipkow. Formal verification of algorithm W: The monomorphic case. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics, volume 1125 of Lect. Notes in Comp. Sci., pages 331–346. Springer-Verlag, 1996.
T. Nipkow. Functional unification of higher-order patterns. In 8th IEEE Symp. Logic in Computer Science, pages 64–74. IEEE Computer Society Press, 1993.
T. Nipkow and C. Prehofer. Type reconstruction for type classes. J. Functional Programming, 5(2):201–224, 1995.
L. C. Paulson. Verifying the unification algorithm in LCF. Science of Computer Programming, 5:143–169, 1985.
L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
L. C. Paulson. Generic automatic proof tools. Technical Report 396, University of Cambridge, Computer Laboratory, 1996.
M. Tofte. Type inference for polymorphic references. Information and Computation, 89:1–34, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naraschewski, W., Nipkow, T. (1998). Type inference verified: Algorithm W in Isabelle/HOL. In: Giménez, E., Paulin-Mohring, C. (eds) Types for Proofs and Programs. TYPES 1996. Lecture Notes in Computer Science, vol 1512. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097799
Download citation
DOI: https://doi.org/10.1007/BFb0097799
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65137-6
Online ISBN: 978-3-540-49562-8
eBook Packages: Springer Book Archive