Binding Time Analysis: A New PERspective (1991)

Cached

Download Links

by Sebastian Hunt , David Sands
Venue:In Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'91
Citations:32 - 4 self

Documents Related by Co-Citation

45 Projection Factorisations in Partial Evaluation – J Launchbury - 1991
87 Abstract Interpretations and Optimising Transformations for Applicative Programs – A Mycroft - 1981
42 Strictness Analysis in Logical Form – Thomas P. Jensen - 1991
91 Projections for Strictness Analysis – Philip Wadler, R. J. M. Hughes - 1987
67 Binding time analysis for higher order untyped functional languages – C Consel - 1990
46 Partial type inference for untyped functional programs – Carsten K Gomard - 1990
53 Strictness Analysis: A New Perspective Based on Type Inference – K Tsung-Min, P Mishra - 1989
201 A Core Calculus of Dependency – Martín Abadi , Anindya Banerjee, Nevin Heintze, Jon G. Riecke - 1999
24 Abstract Interpretation of Functional Languages: From Theory to Practice – Sebastian Hunt - 1991
13 Higher-order Binding-time Analysis – Kei Davis - 1993
13 Fixed points and frontiers: a new perspective – Sebastian Hunt, Chris Hankin - 1991
69 Strictness analysis for higher-order functions – Geoffrey L Burn, Chris Hankin, Samson Abramsky - 1986
29 Abstract Interpretation in Logical Form – T Jensen - 1992
81 A Per Model of Secure Information Flow in Sequential Programs – Andrei Sabelfeld , David Sands - 1998
14 Projections for specialisation – J Launchbury - 1988
60 Data flow analysis of applicative programs using minimal function graphs – N D Jones, A Mycroft - 1986
15 PERs generalise projections for strictness analysis – S Hunt - 1990
59 A Per Model of Polymorphism and Recursive Types – M. Abadi, G. D. Plotkin - 1990
136 Semantic Domains – C. A. Gunter, D. S. Scott - 1990