Steven L. Jenkins, Gary T. Leavens  Home/Search
Context
Related
| iastate.edu/~sjenkins/complang.ps iastate.edu/~sjenkins/complang.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: iastate.edu/~sjenkins/homepage (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a type system that is simple enough to be used by beginning students, yet is powerful enough to express the ideas of polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs some rudimentary syntax checking. The system uses subtyping, but only in a primitive fashion. It has a type... (Update)
Similar documents (at the sentence level):
54.1%: Polymorphic Type-Checking in Scheme - Jenkins, Leavens (1996) (Correct)
Active bibliography (related documents): More All
0.2: Practical Soft Typing - Wright (1994) (Correct)
0.2: Selectors Make Analyzing case-lambda Too Hard - Meunier, Findler, Steckler, Wand (2001) (Correct)
0.1: Programming with Intersection Types and Bounded Polymorphism - Pierce (1991) (Correct)
Similar documents based on text: More All
0.1: Feed-forward Neural Nets as Models for Time Series Forecasting - Tang, Fishwick (1993) (Correct)
0.1: Weak Behavioral Subtyping for Types with Mutable Objects - Dhara, Leavens (1994) (Correct)
0.1: An Exact Algebraic Characterization of Behavioral Subtyping - Leavens, Pigozzi (1995) (Correct)
BibTeX entry: (Update)
@article{ jenkins96polymorphic,
author = "Steven Jenkins and Gary T. Leavens",
title = "Polymorphic Type-Checking in Scheme",
journal = "Computer Lanugages",
volume = "22",
number = "4",
pages = "215--223",
year = "1996",
url = "citeseer.ist.psu.edu/jenkins97polymorphic.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
430 Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985
254 Revised 4 report on the algorithmic language scheme - Clinger, Rees - 1991
127 Control-flow analysis in Scheme (context) - Shivers - 1988
65 A practical soft type system for scheme - Wright, Cartwright - 1993
59 Basic polymorphic typechecking - Cardelli - 1987
33 Semantic prototyping system (context) - Wand - 1989
32 Scheme and the Art of Programming (context) - Springer, Friedman - 1989
23 Constrained Quantification in Polymorphic Type Analysis (context) - Curtis - 1990
21 Principal type schemes and lambda-calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
13 Soft Typing: An Approach to Type Checking for Dynamically Ty.. - Fagan - 1992
5 Type reconstruction for variablearity procedures - Dzeng, Haynes - 1994
3 STYLE: A practical type checker for Scheme - Lindig - 1993
Documents on the same site (http://www.public.iastate.edu/~sjenkins/homepage.html):
Development of Parallel Cloze Tests Using Cohesion - Jenkins (1996) (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