Andrew K. Wright, Matthias Felleisen  Home/Search
Context Related
| rice.edu/CS/PLT/Publica...ic94wf.ps.gz rice.edu/CS/PLT/Public...tr91160.ps.gz princeton.edu/fac/appel/p...wright94.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rice.edu/CS/PLT/Publications/ (more) From: princeton.edu/fac/appel/proofs... Homepages: A.Wright |
Rate this article:      (best)Comment on this article |
Abstract: We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the language semantics. The approach easily extends from polymorphic functional languages to imperative languages that provide references, exceptions, continuations, and similar features. We illustrate the ... (Update)
Cited by: More
Intersection Types and Computational Effects - Rowan Davies Carnegie (Correct)
Polymorphic Type Assignment and CPS Conversion - To Appear Acm (Correct)
Compiling with Non-Parametric Polymorphism - Preliminary Report Robert (Correct)
Active bibliography (related documents): More All
0.7: Typing References by Effect Inference - Andrew Wright (1992) (Correct)
0.5: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.3: Polymorphism for Imperative Languages without Imperative Types - Andrew Wright (1993) (Correct)
Similar documents based on text: More All
0.5: Syntactic Type Soundness for HM(X) - Skalka (2002) (Correct)
0.4: Automating Type Soundness Proofs via Decision Procedures and.. - Syme, Gordon (Correct)
0.1: Reasoning about Programs in Continuation-Passing Style - Sabry (Correct)
Related documents from co-citation: More All
38: Type inference for polymorphic references (context) - Tofte - 1990
32: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
17: Compiling with Continuations (context) - Appel - 1992
BibTeX entry: (Update)
Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Technical Report Rice COMP TR91-160, Rice University, Houston, Texas, 1991. http://citeseer.ist.psu.edu/wright92syntactic.html More
@article{ wright94syntactic,
author = "Andrew K. Wright and Matthias Felleisen",
title = "A Syntactic Approach to Type Soundness",
journal = "Information and Computation",
volume = "115",
number = "1",
pages = "38-94",
year = "1994",
url = "citeseer.ist.psu.edu/wright92syntactic.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
906 A structural approach to operational semantics - Plotkin - 1981
809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
343 Principal type schemes for functional programs (context) - Damas, Milner - 1982
259 Combinatory Logic (context) - Curry, Feys - 1958
214 An ideal model for recursive polymorphic types (context) - MacQueen, Plotkin et al. - 1984
197 Revised 3 report on the algorithmic language Scheme - Rees, Clinger - 1986
184 Definitional interpreters for higher order programming langu.. (context) - Reynolds - 1972
163 Commentary on Standard ML (context) - Milner, Tofte - 1991
162 Data types as lattices (context) - Scott - 1976
160 The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
138 Type inference for polymorphic references (context) - Tofte - 1990
137 Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
87 Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1987
87 call-by-value and the lambda-calculus (context) - Plotkin - 1975
81 The theory and practice of first-class prompts (context) - Felleisen - 1988
77 Co-induction in relational semantics (context) - Milner, Tofte - 1991
76 Control operators (context) - Felleisen, Friedman - 1986
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
67 Higher-order Concurrency - Reppy - 1991
60 ACM Transactions on Programming Languages and Systems (context) - Donahue, Demers - 1985
54 Type Assignment in Programming Languages (context) - Damas - 1985
52 the relation between direct and continuation semantics (context) - Reynolds - 1974
41 Polymorphic type inference and assignment - Leroy, Weis - 1991
36 Parameter-passing and the lambda calculus - Crank, Felleisen - 1991
20 Typing references by effect inference - Wright - 1992
6 and proving with function abstractions and memories (context) - Mason, Talcott - 1989
5 and Harper (context) - Mitchell - 1988
5 Standard ML of New Jersey release notes (context) - of, release et al. - 1991
4 A sequent calculus for type assignment (context) - Seldin - 1977
2 Ecole des Mines de Paris (context) - Talpin, Jouvelot et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/): More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998) (Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993) (Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC