A Practical Soft Type System for Scheme (1993)

by Andrew K. Wright , Robert Cartwright
Venue:In Proceedings of the 1994 ACM Conference on LISP and Functional Programming
Citations:103 - 4 self

Documents Related by Co-Citation

108 Set-based analysis of ML programs – N Heintze - 1994
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
182 Soft typing with conditional types – Er Aiken - 1994
267 Control-Flow Analysis of Higher-Order Languages – Olin Shivers - 1991
49 Effective Flow Analysis for Avoiding Run-Time Checks – Suresh Jagannathan, Andrew Wright - 1995
51 Global Tagging Optimization by Type Inference – Fritz Henglein - 1992
490 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
175 Soft Typing – Robert Cartwright, Mike Fagan - 1991
89 Simple Imperative Polymorphism – Andrew Wright - 1995
1637 Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints – P Cousot, R Cousot - 1977
71 A Unified Treatment of Flow Analysis in Higher-Order Languages – Suresh Jagannathan, Stephen Weeks - 1995
43 Physical Type Checking for C – Satish Chandra, Thomas Reps - 1999
153 Revised report on the algorithmic language Scheme – W Clinger, J Rees - 1991
20 Set-Based Analysis for Full Scheme and Its Use in Soft-Typing – Cormac Flanagan, Matthias Felleisen - 1995
48 Quasi-static typing – Satish Thatte - 1990
314 A First Step towards Automated Detection of Buffer Overrun Vulnerabilities – David Wagner, Jeffrey S. Foster, Eric A. Brewer, Alexander Aiken - 2000
286 CCured: Type-Safe Retrofitting of Legacy Code – George C. Necula, Scott McPeak, Westley Weimer - 2002
151 Refinement types for ML – Tim Freeman - 1994
235 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993