A practical soft type system for Scheme

Authors:
Andrew K. Wright;Robert Cartwright
Affiliations:
Department of Computer Science, Rice University, Houston, TX;Department of Computer Science, Rice University, Houston, TX
Venue:
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Year:
1994

Citing 18
Cited 30

Type checking records and variants in a natural extension of ML

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TICL—a type inference system for common Lisp

Software—Practice & Experience
Partial type inference for untyped functional programs

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Quasi-static typing

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Subtyping recursive types

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft typing

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Type inference in the presence of overloading, subtyping and recursive types

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Global tagging optimization by type inference

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Soft typing: an approach to type checking for dynamically typed languages

Soft typing: an approach to type checking for dynamically typed languages
Type inference for partial types is decidable

ESOP'92 Symposium proceedings on 4th European symposium on programming
Type inclusion constraints and type inference

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A practical approach to type inference for EuLisp

Lisp and Symbolic Computation
Soft typing with conditional types

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Scheme for the Automatic Inference of Variable Types

Journal of the ACM (JACM)
Type Inference with Partial Types

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Set Based Analysis of ML Programs (Extended Abstract)

Set Based Analysis of ML Programs (Extended Abstract)

Set-based analysis of ML programs

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantics of future and its use in program optimization

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Register allocation using lazy saves, eager restores, and greedy shuffling

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Higher-order distributed objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
A polymorphic record calculus and its compilation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic typing and subtype inference

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Catching bugs in the web of program invariants

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Program verification through soft typing

ACM Computing Surveys (CSUR)
A practical and flexible flow analysis for higher-order languages

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical soft type system for scheme

ACM Transactions on Programming Languages and Systems (TOPLAS)
A practical subtyping system for Erlang

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Dynamic typing for distributed programming in polymorphic languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Intersection types and computational effects

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scheme: the new generation

ACM SIGPLAN Lisp Pointers
Intersection types and bounded polymorphism

Mathematical Structures in Computer Science
Regular expression pattern matching for XML

Journal of Functional Programming
The semantics of future and an application

Journal of Functional Programming
Trust in the λ-calculus

Journal of Functional Programming
Soft typing

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct

Higher-Order and Symbolic Computation
Hybrid type checking

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking type safety of foreign function calls

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flow Analysis of Code Customizations

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Interfaces and Metainterfaces for Models and Metamodels

MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Securing information flow via dynamic capture of dependencies

Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Hybrid type checking

ACM Transactions on Programming Languages and Systems (TOPLAS)
TeJaS: retrofitting type systems for JavaScript

Proceedings of the 9th symposium on Dynamic languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.