A practical soft type system for Scheme
Andrew K. Wright, Robert Cartwright · 1994
Soft typing is a generalization of static type checking that accommodates both dynamic typing and static typing in one framework. A soft type checker infers types for identifiers and inserts explicit run-time checks to transform untypable programs into typable form. Soft Scheme is a practical soft type system for R4RS Scheme. The type checker uses a representation for types that is expressive, easy to interpret, and supports efficient type inference. Soft Scheme supports all of R4RS Scheme, including uncurried procedures of fixed and variable arity, assignment, and continuations.
Cited by 66 works. doi:10.1145/182409.182485 Open-access PDF
Authors
References
- A theory of type polymorphism in programming
- The Definition of Standard ML
- The Rapid Evaluation of Potential Fields in Particle Systems
- The principle type-scheme of an object in combinatory logic
- A Syntactic Approach to Type Soundness
- Revised 4 report on the algorithmic language scheme
- Coercion and type inference
- Complete Type Inference for Simple Objects
- J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
- Type assignment in programming languages