论文信息 - A Practical Type Checker for Scheme Style |a Practical Type Checker for Scheme

A Practical Type Checker for Scheme Style |a Practical Type Checker for Scheme

This paper describes an new tool for nding errors in R 4 RS-compliant Scheme programs. A polymorphic type system in the style of Damas & Milner (1982) with an additional maximum type is used to type Scheme code. Although Scheme is dynamically typed, most parts of programs are statically typeable; type inconsistencies are regarded as hints to possible programming errors. The paper rst introduces a type system which is a careful balance between rigorous type safety and pragmatic type softness. An eecient and portable implementation based on order sorted uniication in Scheme is then described. We obtained very satisfactory results on realistic programs, including the programs in Abelson, Sussman & Sussman (1985).

Christian Lindig

[1] Antoni Diller. Compiling functional languages , 1988 .

[2] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[3] Fritz Henglein. Dynamic Typing , 1992, ESOP.

[4] Carsten K. Gomard. Partial type inference for untyped functional programs , 1990, LISP and Functional Programming.

[5] Michel Bidoit,et al. A Rehabilitation of Robinson's Unification Algorithm , 1983, IFIP Congress.

[6] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7] Christoph Walther,et al. Unification in Many-Sorted Theories , 1984, ECAI.

[8] Didier Rémy. Extension of ML type system with a sorted equation theory on types , 1992 .

[9] WadlerPhilip,et al. Report on the programming language Haskell , 1992 .

[10] Mike Fagan,et al. Soft typing: an approach to type checking for dynamically typed languages , 1992 .

[11] Harry G. Mairson,et al. Unification and ML-Type Reconstruction , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[12] M.N. Sastry,et al. Structure and interpretation of computer programs , 1986, Proceedings of the IEEE.

[13] Tobias Nipkow,et al. Type Classes and Overloading Resolution via Order-Sorted Unification , 1991, FPCA.

[14] Kwan-Liu Ma,et al. TICL—A type inference system for Common Lisp , 1990, Softw. Pract. Exp..