Complexity Analysis for a Lazy Higher-Order Language (1990)

Cached

Download Links

by David Sands
Venue:In Proceedings of the 3rd European Symposium on Programming
Citations:44 - 2 self

Documents Related by Co-Citation

76 Automatic complexity analysis – M Rosendahl - 1989
50 An Automatic Complexity Evaluator – D ACE Le Metayer - 1988
53 Automatic Average-Case Analysis Of Algorithms – Philippe Flajolet, E De Recherche, Et En Automatique, Domaine De Voluceau, Bruno Salvy, Bruno Salvy, Paul Zimmermann, Paul Zimmermann - 1991
80 Mechanical program analysis – B Wegbreit - 1975
113 Proving the correctness of reactive systems using sized types – John Hughes, Lars Pareto, Amr Sabry - 1996
108 The art of computer programming. Volume 1 – D E Knuth - 1997
15 The Automatic Complexity Analysis of Divide-and-Conquer Programs – P Zimmermann, W Zimmermann - 1989
56 On the False Path Problem in Hard Real-Time Programs – Peter Altenbernd - 1996
118 Predicting program execution times by analyzing static and dynamic program paths – C Y Park - 1993
43 Static dependent costs for estimating execution time – Brian Reistad, David K. Gifford - 1994
33 Strictness Analysis Aids Time Analysis – Philip Wadler - 1988
28 Calculi for Time Analysis of Functional Programs – D Sands - 1990
72 Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming – John Hughes, Lars Pareto - 1999
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
36 Automatic Accurate Time-Bound Analysis for High-Level Languages – Yanhong Liu, Gustavo Gomez - 1998
636 Structure and Interpretation of Computer Programs – H Abelson, G J Sussman, J Sussman - 1985
91 Projections for Strictness Analysis – Philip Wadler, R. J. M. Hughes - 1987
406 The Omega Test: a fast and practical integer programming algorithm for dependence analysis – William Pugh - 1992
21 Goal-Directed Program Transformation – B WEGBREIT - 1976