Christian Mossin DIKU, University of Copenhagen  Home/Search
Context Related
Links: ACM DBLP | diku.dk/diku/semantics/pa...D329.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: diku.dk/researchgroups/to...1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The concepts of value- and control-flow graphs are important for program analysis of imperative programs. An imperative value flow graph can be constructed by a single pass over the program text. No similar concepts exist for higher-order languages: we propose a method for constructing value flow graphs for typed higher-order functional languages. A higher-order value flow graph is constructed by a single pass over an explicitly typed program. By using standard methods, single source and... (Update)
Context of citations to this paper: More
...sums and recursive types. Soundness for the dynamic system follows by the construction. The proof of the following theorem can be found in [7]. Theorem 5. Let C,e 1 ,e 2 ,T 1 ,A,t be given such that T 1 A C[e 1 ] t and e 1 reduces to e 2 by a fi or ffi redex. Then there...
...in the algorithm is in fact a representation of the type of the program. In this sense our work is related to the type based approaches of [33, 14]. These approaches perform (explicit or implicit) expansion (based on the type structure) of the program, and then use a simple...
Cited by: More
Flow Analysis: Games and Nets (Extended Abstract) - Hankin, Nagarajan, Sampath (2002) (Correct)
Higher-Order Value Flow Graphs - Christian Mossin Diku (1997) (Correct)
Active bibliography (related documents): More All
0.2: Safety Analysis versus Type Inference - Palsberg, Schwartzbach (1995) (Correct)
0.1: Exact Flow Analysis - Mossin (1997) (Correct)
0.1: Flow Analysis: Games and Nets - Hankin, Nagarajan, Sampath (Correct)
Similar documents based on text: More All
0.1: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
0.1: Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
0.1: Parameterized Signatures and Higher-Order Modules - Shao (1998) (Correct)
Related documents from co-citation: More All
4: Global program analysis in constraint form (context) - Palsberg - 1994
4: Flow analysis of typed higher-order programs (context) - Mossin - 1997
4: Analysis and Efficient Implementation of Functional Programs - Sestoft - 1991
BibTeX entry: (Update)
C. Mossin. Higher-order value flow graphs. Technical report, DIKU, 1997. http://citeseer.ist.psu.edu/article/mossin97higherorder.html More
@inproceedings{ mossin97higherorder,
author = "Christian Mossin",
title = "Higher-Order Value Flow Graphs",
booktitle = "Ninth International Symposium on Programming Languages, Implementations, Logics, and Programs ({PLILP})",
publisher = "Springer-Verlag",
address = "Southampton, UK",
pages = "159--174",
year = "1997",
url = "citeseer.ist.psu.edu/article/mossin97higherorder.html" }
Citations (may not include all citations):143 Theorems for free - Wadler - 1989
129 Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995 ACM DBLP
74 Replacing function parameters by global variables (context) - Sestoft - 1988
53 Control-flow analysis and type systems - Heintze - 1995
46 Analysis and Efficient Implementation of Functional Language.. - Sestoft - 1991
33 Flow Analysis of Typed Higher-Order Programs (context) - Mossin - 1997
18 Dynamic typing: Syntax and proof theory (context) - Henglein - 1994
14 Global program analysis in constraint form (context) - Palsberg - 1994
11 computations and labels in the -calculus (context) - Asperti, Laneve - 1993
4 Higher-order value flow graphs - Mossin - 1997 ACM DBLP
4 Efficient closure analysis with reachability (context) - Ayers - 1992
3 Control-flow analysis for ML in linear time - Heintze, McAllester - 1997
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1997.html): More
A kappa-denotational semantics for Map Theory in ZFC + SI - Berline, Grue (1996) (Correct)
Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (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