David Sands  Home/Search
Context
Related
| cs.chalmers.se/~da...CFINALVERSION.ps 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.chalmers.se/~dave/davewww (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Techniques for reasoning about extensional properties of functional programs are well understood, but methods for analysing the underlying intensional or operational properties have been much neglected. This paper begins with the development of a simple but useful calculus for time analysis of non-strict functional programs with lazy lists. One limitation of this basic calculus is that the ordinary equational reasoning on functional programs is not valid. In order to buy back some of these... (Update)
Similar documents (at the sentence level):
54.3%: A Naïve Time Analysis and its Theory of Cost Equivalence - Sands (Correct)
Active bibliography (related documents): More All
0.7: Operational Theories of Improvement in Functional Languages.. - Sands (1991) (Correct)
0.4: From SOS Rules to Proof Principles: An Operational Metatheory for.. - Sands (1997) (Correct)
0.4: Complexity Analysis for a Lazy Higher-Order Language - Sands (1990) (Correct)
Similar documents based on text: More All
0.1: Turchin's Supercompiler Revisited - An operational theory of.. - Sørensen (1996) (Correct)
0.1: Total Correctness by Local Improvement in Program Transformation - Sands (1995) (Correct)
0.1: A New Means of Ensuring Termination of Deforestation - Sørensen (1993) (Correct)
BibTeX entry: (Update)
@article{ sands1995:_na_tim_anal,
author = "David Sands",
title = "A Na{\"\i}ve Time Analysis and its Theory of Cost
Equivalence",
journal = "Journal of Logic and Computation",
year = 1995,
volume = 5,
number = 4,
pages = "495--541",
url = "citeseer.ist.psu.edu/article/sands95naiumlve.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
502 Concurrency and automata on infinite sequences (context) - Park - 1980
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
333 Introduction to Functional Programming (context) - Bird, Wadler - 1988
216 Theoretical Computer Science (context) - Milner, synchrony - 1983
179 The lazy lambda calculus - Abramsky - 1990
102 Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987
100 Volume 1: Fundamental Algorithms (context) - Knuth - 1968
94 Equality in lazy computation systems - Howe - 1989
94 Projections for strictness analysis - Wadler, Hughes - 1987
77 Co-induction in relational semantics (context) - Milner, Tofte - 1991
65 Equivalence in functional languages with effects - Mason, Talcott - 1991
53 Prentice-Hall International Series in Computer Science (context) - Jones, of et al. - 1987
49 Automatic complexity analysis (context) - Rosendahl - 1989
37 Complexity analysis for a lazy higher-order language - Sands - 1989
37 Complexity analysis for a lazy higher-order language - Sands - 1990
33 Context-Dependent Bisimulation Between Processes (context) - Larsen - 1986
29 Automating program analysis (context) - Hickey, Cohen - 1988
26 A syntactic approach to program transformation - Ariola - 1991
25 Elsevier Science Publishers B (context) - Barendregt, Calculus et al. - 1984
24 Calculi for Time Analysis of Functional Programs (context) - Sands - 1990
23 Strictness analysis aids time analysis - Wadler - 1988
23 Constructive versions of Tarski's fixed point theorems - Cousot, Cousot - 1979
20 A compositional approach to time analysis of first order laz.. (context) - Bjerner, Holmstrom - 1989
19 The theory and practice of strictness analysis for higher or.. (context) - Burn, Hankin et al. - 1986
18 On computational open-endedness in Martin-Lof's type theory (context) - Howe - 1991
13 Operational theories of improvement in functional languages - Sands - 1991
12 The Semantics of Destructive Lisp (context) - Mason - 1986
12 The evaluation transformer model of reduction and its correc.. - Burn - 1991
11 cost equivalence and program refinement (context) - Sands - 1991
11 Computational comonads and intensional semantics - Brookes, Geva - 1992
10 Total correctness and improvement in the transformation of f.. (context) - Sands - 1994
10 Inverse image analysis generalises strictness analysis (context) - Dybjer - 1991
9 Static evaluation of functional programs (context) - Lindstrom - 1986
8 Complexity analysis for a higher order language (context) - Sands - 1988
7 Time Complexity of Programs in Type Theory (context) - Bjerner - 1989
6 The Lazy Lambda Calculus: An Investigation into the Foundati.. (context) - Luke - 1988
5 Available as reports CST-72-91 and ECS-LFCS (context) - Gurr, for et al. - 1991
5 A Theory of the Intensional and Extensional Aspects of Lisp-.. (context) - Talcott, of - 1985
3 A co-induction principal for recursively defined domains (context) - Pitts - 1992
2 An automatic complexity evaluator (context) - LeMetayer - 1988
2 Appendices A Proofs This appendix contains some details of p.. (context) - Wegbreit, analysis et al. - 1975
Documents on the same site (http://www.cs.chalmers.se/~dave/davewww.html): More
Improvement in a Lazy Context: An Operational Theory for.. - Moran, Sands (1999) (Correct)
Improvement in a Lazy Context: An Operational Theory for.. - Moran, Sands (1999) (Correct)
Erratic Fudgets: A Semantic Theory for an Embedded.. - Moran, Sands, Carlsson (1999) (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