A Practical Soft Type System for Scheme

dc.contributor.authorCartwright, Robert
dc.contributor.authorWright, Andrew
dc.date.accessioned2017-08-02T22:03:20Z
dc.date.available2017-08-02T22:03:20Z
dc.date.issued1993-12-06
dc.date.noteDecember 6, 1993
dc.description.abstractSoft type systems provide the benefits of static type checking for dynamically typed languages without rejecting untypable programs. A soft type checker infers types for variables and expressions and inserts explicit run-time checks to transform untypable programs to typable form. We describe a practical soft type system for R4RS Scheme. Our 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 procedures of fixed and variable arity, assignment, continuations, and top-level definitions. Our implementation is available by anonymous FTP.
dc.format.extent21 pp
dc.identifier.citationCartwright, Robert and Wright, Andrew. "A Practical Soft Type System for Scheme." (1993) https://hdl.handle.net/1911/96436.
dc.identifier.digitalTR93-218
dc.identifier.urihttps://hdl.handle.net/1911/96436
dc.language.isoeng
dc.rightsYou are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.titleA Practical Soft Type System for Scheme
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR93-218.pdf
Size:
13.2 MB
Format:
Adobe Portable Document Format