Alexander Aiken, Brian R. Murphy  Home/Search
Context Related
| berkeley.edu/~aiken/ftp/popl91.ps unibwmuenchen.de/pub/co...popl91.ps.gz berkeley.edu/~aiken/publica...popl91.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: berkeley.edu/~aiken/pubs (more) From: fermivista.math...ibwmuenchen.de (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a type inference system for FL based on an operational, rather than a denotational, formulation of types. The essential elements of the system are a type language based on regular trees and a type inference logic that implements an abstract interpretation of the operational semantics of FL. We use a non-standard approach to type inference because our requirements---using type information in the optimization of functional programs---differ substantially from those of other type... (Update)
Context of citations to this paper: More
.... binding time analysis for partial evaluation by Mogensen [36] set based analysis of ML by Heintze [20] type inference by Aiken et al. [3, 4], backward slicing by Reps and Turnidge [50] and set based analysis for debugging Scheme by Flanagan and Felleisen [16] Some of 22...
...the intended bindingtime for a particular expression. ffl Dynamic typing: Dynamic typing also known as tagging untagging analysis [AM91, Hen92, WC94] aims to remove type tags as much as possible in a dynamically typed language. One might be tempted to view, say, distrust as...
Cited by: More
Interconvertibility of a Class of Set Constraints and.. - Melski, Reps (1998) (Correct)
On the Specialization of Online Program Specializers - Ruf, Weise (1992) (Correct)
Demand-Driven Type Analysis for Dynamically-Typed Functional.. - Dubé (Correct)
Active bibliography (related documents): More All
0.9: Implementing Regular Tree Expressions - Aiken, Murphy (1991) (Correct)
0.2: Solving Systems of Set Constraints (Extended Abstract) - Aiken, al. (1992) (Correct)
0.2: Mode Checking in HAL - Banda, Stuckey, Harvey, Marriott (Correct)
Similar documents based on text: More All
0.1: Integrating Meeting Results In Organisations - Costa, Antunes, Dias (2000) (Correct)
0.1: Supporting the Meeting Report Process - Costa, Antunes, Dias (2000) (Correct)
0.1: Reasoning About Set Constraints Applied to Tractable.. - Drakengren, Jonsson (1996) (Correct)
Related documents from co-citation: More All
41: Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
31: Declaration-free type checking (context) - Mishra, Reddy - 1985
24: A finite presentation theorem for approximating logic programs - Heintze, Jaffar - 1990
BibTeX entry: (Update)
A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279--290, January 1991. http://citeseer.ist.psu.edu/aiken91static.html More
@inproceedings{ aiken91static,
author = "Alexander Aiken and Brian R. Murphy",
title = "Static Type Inference in a Dynamically Typed Language",
booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages",
address = "Orlando, Florida",
pages = "279--290",
year = "1991",
url = "citeseer.ist.psu.edu/aiken91static.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin
809 A theory of type polymorphism in programming (context) - Milner - 1978
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
150 Report on the Functional Programming Language Haskell (context) - Hudak, Wadler et al. - 1988
94 A finite presentation theorem for approximating logic progra.. - Heintze, Jaffar - 1990
74 Memo' functions and machine learning (context) - Michie - 1968
66 Declaration-free type checking (context) - Mishra, Reddy - 1985
63 Laboratory for Foundations of Computer Science (context) - Harper, Milner et al. - 1989
39 Type inference with partial types (context) - Thatte - 1988
23 Experience with a type evaluator (context) - Young, O'Keefe - 1988
18 Principle type-schemes for functional programs (context) - Damas, Milner - 1982
14 ACM Transactions on Programming Languages and Systems (context) - Nielson, in et al. - 1985
8 A collecting interpretation of expressions (context) - Hudak, Young - 1988
6 FL Language Manual (context) - Backus - 1989
5 Academei Kaido (context) - Gecseg, Steinby - 1984
2 A Type Inference System for FL (context) - Murphy - 1990
1 FP with data abstraction and strong typing (context) - Guttag, Horning et al. - 1981
1 Type inference and type checking for functional languages: a.. (context) - Katayama - 1984
1 Specification of data structures for FP programs (context) - Frank - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~aiken/pubs.html): More
Decidability of Systems of Set Constraints with Negative.. - Aiken, Kozen, Wimmers (1995) (Correct)
Program Transformation in the Presence of Errors - Aiken, Williams, Wimmers (1990) (Correct)
Implementing Regular Tree Expressions - Aiken, Murphy (1991) (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