Jens Palsberg, Christina Pavlopoulou  Home/Search
Context Related
| purdue.edu/homes/p...fptoappear.ps.gz purdue.edu/homes/tzh...jfptoappear.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: purdue.edu/homes/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many polyvariant program analyses have been studied in the 1990s, including k-CFA, polymorphic splitting, and the cartesian product algorithm. The idea of polyvariance is to analyze functions more than once and thereby obtain better precision for each call site. In this paper we present an equivalence theorem which relates a co-inductively defined family of polyvariant flow analyses and a standard type system. The proof embodies a way of understanding polyvariant flow information in terms of... (Update)
Cited by: More
Tridirectional Typechecking - Dunfield, Pfenning (2004) (Correct)
Instant Polymorphic Type Systems for Mobile Process Calculi.. - Makholm, Wells (2005) (Correct)
Similar documents (at the sentence level):
6.8%: From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (1998) (Correct)
Active bibliography (related documents): More All
1.5: Type-Based Analysis and Applications - Palsberg (2001) (Correct)
1.1: A Type System Equivalent to Model Checking - Naik (2003) (Correct)
0.8: CPS Transformation of Flow Information - Palsberg, Wand (2001) (Correct)
Similar documents based on text: More All
0.7: Faithful Translations between Polyvariant Flows and.. - Amtoft, Turbak (2000) (Correct)
0.5: Analyses that Distinguish Different Evaluation Orders or.. - Wand (2002) (Correct)
0.5: Polyvariant Flow Analysis with Constrained Types - Smith, Wang (2000) (Correct)
Related documents from co-citation: More All
24: Dependent types in practical programming - Xi, Pfenning - 1999
19: Refinement types for ML - Freeman, Pfenning - 1991
15: A calculus with polymorphic and polyvariant flow types - Wells, Dimock et al.
BibTeX entry: (Update)
Jens Palsberg and Christina Pavlopoulou. From polyvariant flow information to intersection and union types. In Proc. POPL'98, 25th Annual SIGPLAN--SIGACT Symposium on Principles of Programming Languages, pages 197--208, San Diego, California, January 1998. http://citeseer.ist.psu.edu/palsberg00from.html More
@inproceedings{ palsberg98from,
author = "Jens Palsberg and Christina Pavlopoulou",
title = "From Polyvariant Flow Information to Intersection and Union Types",
booktitle = "Conference Record of {POPL} 98: The 25TH {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages, San Diego, California",
address = "New York, NY",
pages = "197--208",
year = "1998",
url = "citeseer.ist.psu.edu/palsberg00from.html" }
Citations (may not include all citations):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 - 1981
521 Compiling with Continuations (context) - Appel - 1992
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
246 Contextsensitive interprocedural points-to analysis in the p.. - Emami, Ghiya et al. - 1994
233 Natural semantics (context) - Kahn - 1987
187 Type inclusion constraints and type inference - Aiken, Wimmers - 1993
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
118 What are principal typings and what are they good - Jim - 1996
85 Type inference with simple subtypes (context) - Mitchell - 1991
83 Automatic autoprojection of higher order recursive equations (context) - Bondorf - 1991
82 Coercion and type inference (context) - Mitchell - 1984
77 Co-induction in relational semantics (context) - Milner, Tofte - 1991
76 Type inference for recursively constrained types and its app.. - Eifrig, Smith et al. - 1995
69 A tour of Schism: A partial evaluation system for higher-ord.. - Consel - 1993
67 ACM Transactions on Programming Languages and Systems (context) - Palsberg, Smith et al. - 1996
54 Safety analysis versus type inference - Palsberg, Schwartzbach - 1995
52 Programming with intersection types (context) - Pierce - 1991
49 Polymorphic binding time analysis (context) - Henglein, Mossin - 1994
47 Intersection and union types: Syntax and semantics (context) - Barbanera, Dezani-Ciancaglini et al. - 1995
41 The Cartesian product algorithm (context) - Agesen - 1995
39 A complete type inference algorithm for simple intersection .. (context) - Coppo, Giannini - 1992
38 Selective and lightweight closure conversion - Wand, Steckler - 1994
38 Proof of translation in natural semantics (context) - elle - 1986
37 Types as abstract interpretations (context) - Cousot - 1997
36 A type system for Smalltalk - Graver, Johnson - 1990
36 Natural-semantics-based abstract interpretation (context) - Schmidt - 1995
31 Sound polymorphic type inference for objects (context) - Eifrig, Smith et al. - 1995
29 Concrete Type Inference: Delivering Object-Oriented Applicat.. (context) - Agesen - 1995
25 A new technique for strictness analysis (context) - Wright - 1991
24 Call graph construction in object-oriented languages (context) - Grove, DeFouw et al. - 1997
21 Principal type schemes and lambda-calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
20 Compile-time detection of uncaught exceptions in standard ML.. - Yi - 1994
18 Intersection Type Disciplines in Lambda Calculus and Applica.. (context) - van Bakel - 1991
18 A type system equivalent to ow analysis (context) - Palsberg, O'Keefe - 1995
16 Strictness analysis: A new perspective based on type inferen.. (context) - Kuo, Mishra - 1989
16 Sifting out the gold: Delivering compact applications from a.. - Agesen, Ungar - 1994
16 Fundamental properties of innite trees (context) - Courcelle - 1983
15 Two approaches to interprocedural data ow analysis (context) - Sharir, Pnueli - 1981
15 A exible approach to interprocedural data ow analysis of pro.. (context) - Jones, Muchnick - 1982
15 Strongly typed ow-directed representation transformations (context) - Dimock, Muller et al. - 1997
14 Linear-time subtransitive control ow analysis (context) - Heintze, McAllester - 1997
14 A unied treatment of ow analysis in higher-order languages (context) - Jagannathan, Weeks - 1995
13 A typed intermediate language for ow-directed compilation (context) - Wells, Dimock et al. - 1997
13 Control- ow analysis and type systems (context) - Heintze - 1995
12 polyvariant and type-based closure analysis (context) - Banerjee, modular - 1997
12 Typedirected ow analysis for typed intermediate languages (context) - Jagannathan, Wright et al. - 1997
10 Types with intersection: An introduction (context) - Hindley - 1991
9 the complexity of set based analysis - Heintze, McAllester - 1997
8 ective ow analysis for avoiding run-time checks (context) - Jagannathan, Wright - 1995
8 Innitary control ow analysis: A collecting semantics for clo.. (context) - Nielson, Nielson - 1997
7 Separate abstract interpretation for control- ow analysis (context) - Tang, Jouvelot - 1994
6 Equality-based ow analysis versus recursive types (context) - Palsberg - 1998
6 Exact ow analysis (context) - Mossin - 1997
5 Data- ow-based virtual function resolution (context) - Pande, Ryder - 1996
4 Obtaining sequential eciency for concurrent object-oriented .. (context) - Plevyak, Zhang et al. - 1995
4 Principal Typings and Type Inference (context) - Jim - 1996
4 Compiling with polymorphic and polyvariant ow types (context) - Turbak, Dimock et al. - 1997
4 A lattice-theoretical xed point theorem and its applications (context) - Tarski - 1955
4 The typed lambda-calculus with rst-class processes (context) - Nielson - 1989
3 Ecient and exible matching of recursive types (context) - Palsberg, Zhao - 2000
3 Minimal thunkication (context) - Amtoft - 1993
2 Optimizing lazy functional programs using ow inference (context) - Fax - 1995
1 An equational framework for ow analysis of higher-order func.. (context) - Stefanescu, Zhou - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/publications.html): More
Safety Analysis versus Type Inference for Partial Types - Palsberg, Schwartzbach (1992) (Correct)
Comparing Flow-based Binding-time Analyses - Palsberg (1995) (Correct)
Normal Forms have Partial Types - Palsberg (1993) (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