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:33 - 5 self

Documents Related by Co-Citation

47 Projection Factorisation in Partial Evaluation – John Launchbury - 1990
44 Strictness Analysis in Logical Form – Thomas P. Jensen - 1991
98 Projections for Strictness Analysis – Philip Wadler, R. J. M. Hughes - 1987
67 Binding time analysis for higher order untyped functional languages – C Consel - 1990
91 Abstract Interpretation and Optimising Transformations for Applicative Programs – A MYCROFT - 1981
90 A Per Model of Secure Information Flow in Sequential Programs – Andrei Sabelfeld , David Sands - 1998
49 Partial type inference for untyped functional programs (extended abstract – C Gomard - 1990
228 A Core Calculus of Dependency – Martín Abadi , Anindya Banerjee, Nevin Heintze, Jon G. Riecke - 1999
1065 Introduction to lattices and order – B A Davey, H A Priestley - 2002
25 Abstract Interpretation of Functional Languages: From Theory to Practice – Sebastian Hunt - 1991
148 Semantic Domains – C. A. Gunter, D. S. Scott - 1990
13 Higher-order Binding-time Analysis – Kei Davis - 1993
529 Perspectives on Program Analysis – Flemming Nielson - 1996
32 Abstract interpretation in logical form – T Jensen - 1992
70 S.: Strictness analysis for higher-order functions – G L Burn, C L Hankin, Abramsky - 1986
57 Strictness analysis: a new perspective based on type inference – Tsung-Min Kuo, Prateek Mishra - 1989
399 Certification of programs for secure information flow – D E Denning, P J Denning - 1977
235 The slam calculus: programming with secrecy and integrity – Nevin Heintze, Jon G. Riecke - 1998
66 Reitman and. “An Axiomatic Approach to Information Flow in Programs – G R Andrews, R P - 1980