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 to 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
This thesis presents a type system which supports the strong static type checking of programs develo...
() *+Types in programming A type is a collection of computational entities that share some common p...
Abstract. The design and implementation of a correct system can benefit from employing static techni...
Soft type systems provide the benefits of static type checking for dynamically typed languages witho...
Soft typing is an approach to type checking for dynamically typed languages. Like a static type chec...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Soft Interfaces is a module system for Scheme with typed interfaces. This makes it possible to decla...
use of program operations. They can be classified as either static or dynamic depending on when they...
This paper describes an new tool for finding errors in R 4 RS-compliant Scheme programs. A polymor...
We present a simple and powerful type inference method for dynamically typed languages where no type...
We discuss the properties of strictly typed languages on the one hand and soft typing of the other a...
This paper presents a type-inference system for Scheme that is designed to be used by students in an...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
There exists an identifiable programming style based on the widespread use of type information handl...
to find the "best" or "most general" type (called the principal type in the case...
This thesis presents a type system which supports the strong static type checking of programs develo...
() *+Types in programming A type is a collection of computational entities that share some common p...
Abstract. The design and implementation of a correct system can benefit from employing static techni...
Soft type systems provide the benefits of static type checking for dynamically typed languages witho...
Soft typing is an approach to type checking for dynamically typed languages. Like a static type chec...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Soft Interfaces is a module system for Scheme with typed interfaces. This makes it possible to decla...
use of program operations. They can be classified as either static or dynamic depending on when they...
This paper describes an new tool for finding errors in R 4 RS-compliant Scheme programs. A polymor...
We present a simple and powerful type inference method for dynamically typed languages where no type...
We discuss the properties of strictly typed languages on the one hand and soft typing of the other a...
This paper presents a type-inference system for Scheme that is designed to be used by students in an...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
There exists an identifiable programming style based on the widespread use of type information handl...
to find the "best" or "most general" type (called the principal type in the case...
This thesis presents a type system which supports the strong static type checking of programs develo...
() *+Types in programming A type is a collection of computational entities that share some common p...
Abstract. The design and implementation of a correct system can benefit from employing static techni...