Sebastian Hunt, David Sands  Home/Search
Context Related
| cs.city.ac.uk/~seb/paper...pepm91.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: cs.city.ac.uk/~seb/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a description of the parameters in a program that will be known at partial evaluation time, a binding time analysis must determine which parts of the program are dependent solely on these known parts (and therefore also known at partial evaluation time). In this paper a binding time analysis for the simply typed lambda calculus is presented. The analysis takes the form of an abstract interpretation and uses a novel formalisation of the problem of binding time analysis, based on the use of ... (Update)
Cited by: More
Information Flow Analysis in Logical Form - Amtoft, Banerjee (2004) (Correct)
A Logic for Information Flow Analysis with an Application to .. - Amtoft, Banerjee (2005) (Correct)
Simple Relational Correctness Proofs for Static Analyses and.. - Benton (2004) (Correct)
Active bibliography (related documents): More All
1.0: Binding Time Analysis: A New PERspective - Hunt, Sands (1991) (Correct)
0.5: Abstract Interpretation of Functional Languages: From Theory to.. - Hunt (1991) (Correct)
0.2: On-line Off-line Partial Evaluation: Semantic Specifications.. - Consel, Khoo (Correct)
Similar documents based on text: More All
0.1: Hunt and Gather Robotics - Wyeth (Correct)
0.1: PERs from Projections for Binding-Time Analysis - Davis (1994) (Correct)
0.1: Crosshole EM for Oil Field Characterization and EOR Monitoring.. - Wilt, al. (1996) (Correct)
Related documents from co-citation: More All
16: Projection Factorisations in Partial Evaluation (context) - LAUNCHBURY - 1991
9: Binding Time Analysis for Higher Order Untyped Functional Languages (context) - Consel - 1990
9: A Core Calculus of Dependency - Abadi, Banerjee et al. - 1999
BibTeX entry: (Update)
Hunt, S., and Sands, D. "Binding time analysis: a new PERspective." Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '91), SIGPLAN NOTICES Vol. 26, No. 9. ACM Press 1991. http://citeseer.ist.psu.edu/article/hunt91binding.html More
@inproceedings{ hunt91binding,
author = "Sebastian Hunt and David Sands",
title = "Binding Time Analysis: {A} New {PER}spective",
booktitle = "Proceedings of the {ACM} Symposium on Partial Evaluation and Semantics-Based Program Manipulation, June 1991, Yale",
month = "September",
publisher = "ACM SIGPLAN Notices 26(9)",
year = "1991",
url = "citeseer.ist.psu.edu/article/hunt91binding.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
138 Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987 ACM
117 Semantic domains - Scott, Gunter ACM DBLP
85 An experiment in partial evaluation: The generation of a com.. (context) - Jones, Sestoft et al. - 1985 ACM DBLP
65 Binding time analysis for higher order untyped functional la.. (context) - Consel - 1990
56 Projection Factorisations in Partial Evaluation (context) - Launchbury - 1989 ACM
53 Compiletime garbage collection by sharing analysis (context) - Jones, Le M'etayer - 1989
48 Backwards analysis of functional programs (context) - Hughes - 1987
42 A per model of polymorphism and recursive types - Abadi, Plotkin - 1990 DBLP
41 Automatic program specialization: A re-examination from basi.. (context) - Jones - 1988
32 Automatic Methods for Program Transformation (context) - Chin - 1990
30 Two-level semantics and abstract interpretation --- fundamen.. (context) - Nielson
28 Partially static structures in a self-applicable partial eva.. (context) - Mogensen - 1988
28 Automatic binding time analysis for a typed -calculus (context) - Nielson, Nielson - 1988
25 Binding time analysis for polymorphically typed higher order.. (context) - Mogensen - 1989 ACM DBLP
24 Calculi for Time Analysis of Functional Programs (context) - Sands - 1990
18 A relational approach to strictness analysis of higher order.. - Abramsky, Jensen - 1991
15 Projections for specialisation (context) - Launchbury - 1988
10 PERs generalise projections for strictness analysis (context) - Hunt - 1990
9 Categorical Topics in Computer Science (context) - Asperti - 1990
7 Logic and Computation (context) - Abramsky, logical et al. - 1990 ACM
4 Transformations on higher-order functions (context) - Nielson, Nielson - 1989 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.city.ac.uk/~seb/papers.html): More
Safety of Strictness Analysis via Term Graph Rewriting - Clark, Hankin, Hunt (2000) (Correct)
PERs Generalise Projections for Strictness Analysis - Exte Nd Ed (Correct)
Possibilistic Information Flow is safe for.. - Clark, Hankin, Hunt, .. (2000) (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