Alexander Aiken, Manuel Fähndrich  Home/Search
Context Related
| microsoft.com/~maf/affpca95.ps.gz berkeley.edu/~manuel/...affpca95.ps.gz 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: microsoft.com/~maf...publications (more) From: berkeley.edu/~manu...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynamic typing with a subtyping system based on set constraints. The purpose is both to make precise the relationship between two superficially unrelated type systems and to illustrate how the advantages of dynamic typing and subtype inference can be combined. The central result is a theorem showing that a typing discipline... (Update)
Context of citations to this paper: More
...the key features of CLOVER is the combination of both dynamic typing and complete type safety. Previous work in this area includes [AM90, AF95], but this typically abandons complete type safety. 3 Overview of The Rewrite Rules In this section, we present an overview of the...
...of the key features of CLOVER is the combination of both dynamic typing and complete type safety. Previous work in this area includes [AM90, AF95], but this typically abandons complete type safety. 3 Overview of The Transformation Rules In this section, we present an overview...
Cited by: More
The Implementation of CLOVER: A Translation from OOFP to FP - Braine (Correct)
The CLOVER Rewrite Rules: A Translation from OOFP to FP - Braine, Clack (1997) (Correct)
Active bibliography (related documents): More All
0.9: Dynamic Typing and Subtype Inference - Aiken, Fähndrich (1995) (Correct)
0.8: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.1: Set Constraints: Results, Applications and Future Directions - Aiken (Correct)
Similar documents based on text: More All
0.3: Projection Merging: Reducing Redundancies in Inclusion.. - Su, Fähndrich, Aiken (2000) (Correct)
0.1: Polymorphic versus Monomorphic Flow-insensitive.. - Foster, Fähndrich, Aiken (2000) (Correct)
0.1: Implementing Object Equivalence in Java Using the Template - Daniel Stevenson And (Correct)
Related documents from co-citation: More All
2: An Object-Oriented Functional Approach to Information Systems Engineering - Braine, Clack - 1997
2: Object-Flow - Braine, Clack - 1997
2: Multimethods in a statically-typed programming language (context) - Mugridge, Hosking et al. - 1991
BibTeX entry: (Update)
A. Aiken and M. Fahndrich. Dynamic Typing and Subtype Inference. Conference on Functional Programming Languages and Computer Architecture (FPCA'95), pages 182--191, June 1995. http://citeseer.ist.psu.edu/article/aiken95dynamic.html More
@inproceedings{ aiken95dynamic,
author = "Alexander Aiken and Manuel Fahndrich",
title = "Dynamic Typing and Subtype Inference",
booktitle = "Functional Programming Languages and Computer Architecture",
pages = "182-191",
year = "1995",
url = "citeseer.ist.psu.edu/article/aiken95dynamic.html" }
Citations (may not include all citations):187 Type inclusion constraints and type inference - Aiken, Wimmers - 1993
179 Dynamic typing (context) - Henglein - 1992
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
131 Set Based Program Analysis - Heintze - 1992
111 Solving systems of set constraints (context) - Aiken, Wimmers - 1992
78 Soft typing - Cartwright, Fagan - 1991
66 Declaration-free type checking (context) - Mishra, Reddy - 1985
53 Static type inference in a dynamically typed language - Aiken, Murphy - 1991
48 Global tagging optimization by type inference - Henglein - 1992
39 Type inference with partial types (context) - Thatte - 1988
35 Partial type inference for untyped functional programs (context) - Gomard - 1990
28 Quasi-static typing (context) - Thatte - 1990
27 A decision procedure for a class of Herbrand set constraints (context) - Heintze, Jaffar - 1990
16 Analysis of recursive types in Lisp-like languages - Wang, Hilfinger - 1992
15 Set constraints: Results (context) - Aiken - 1994
14 An ideal model for recursive polymophic types (context) - MacQueen, Plotkin et al. - 1984
2 A practical soft typing system for Scheme (context) - Wright, Cartwright - 1994
Documents on the same site (http://www.research.microsoft.com/~maf/publications.html): More
Better Static Memory Management: Improving Region-Based.. - Aiken, al. (1995) (Correct)
Program Analysis Using Mixed Term and Set Constraints - Fähndrich, Aiken (1997) (Correct)
Refined Type Inference for ML - Fähndrich, Aiken (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