Lightweight semiformal time complexity analysis for purely functional data structures

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 133-144

  Danielsson, Nils Anders ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Languages; Performance; Theory; Verification

Indexed keywords

DATA STRUCTURES; QUERY LANGUAGES; VERIFICATION;

ATTENTION TO DETAILS; COMPLEXITY ANALYSIS; FINGER TREES; PERFORMANCE; PURELY FUNCTIONAL; THEORY; TIME COMPLEXITY; TIME COMPLEXITY ANALYSIS;

TREES (MATHEMATICS);

EID: 67649879375     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1328897.1328457     Document Type: Article

References (26)

1. Ralph Benzinger. Automated higher-order complexity analysis. Theoretical Computer Science, 318:79-103, 2004.
2. Bror Bjerner and Sören Holmström. A compositional approach to time analysis of first order lazy functional programs. In FPCA '89, pages 157-165, 1989.
3. Bror Bjerner. Time Complexity of Programs in Type Theory. PhD thesis, Department of Computer Science, University of Göteborg, 1989.
4. Edwin Brady and Kevin Hammond. A dependently typed framework for static analysis of program execution costs. In IFL 2005, volume 4015 of LNCS, pages 74-90, 2006.
5. Edwin Brady, Conor McBride, and James McKinna. Inductive families need not store their indices. In TYPES 2003: Types for Proofs and Programs, volume 3085 of LNCS, pages 115-129, 2004.
6. Venanzio Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2):1-28, 2005.
7. Robert L. Constable and Karl Crary. Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, chapter Computational Complexity and Induction for Partial Computable Functions in Type Theory. A K Peters Ltd, 2002.
8. Karl Crary and Stephanie Weirich. Resource bound certification. In POPL '00, pages 184-198, 2000.
9. Nils Anders Danielsson. A formalisation of the correctness result from "Lightweight semiformal time complexity analysis for purely functional data structures". Technical Report 2007:16, Department of Computer Science and Engineering, Chalmers University of Technology, 2007.
10. Peter Dybjer. Inductive families. Formal Aspects of Computing, 6(4):440-465, 1994.
11. Ralf Hinze and Ross Paterson. Finger trees: A simple general-purpose data structure. Journal of Functional Programming, 16(2):197-217, 2006.
12. Martin Hofmann and Steffen Jost. Type-based amortised heap-space analysis. In ESOP 2006, volume 3924 of LNCS, pages 22-37, 2006.
13. John Hughes, Lars Pareto, and Amr Sabry. Proving the correctness of reactive systems using sized types. In POPL '96, pages 410-423, 1996.
14. Haim Kaplan, Chris Okasaki, and Robert E. Tarjan. Simple confluently persistent catenable lists. SI AM Journal on Computing, 30(3):965-977, 2000.
15. Haim Kaplan and Robert E. Tarjan. Purely functional, real-time deques with catenation. Journal of the ACM, 46(5):577-603, 1999.
16. John Launchbury. A natural semantics for lazy evaluation. In POPL '93, pages 144-154, 1993.
17. Daan Leijen and Erik Meijer. Domain specific embedded compilers. In 2nd USENIX Conference on Domain-Specific Languages (DSL '99), pages 109-122, 1999.
18. Andrew Moran and David Sands. Improvement in a lazy context: an operational theory for call-by-need. In POPL '99, pages 43-56, 1999.
19. Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology and Goteborg University, 2007.
20. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
21. Christine Paulin-Mohring. Extracting F∞'s programs from proofs in the calculus of constructions. In POPL '89, pages 89-104, 1989.
22. Simon Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
23. @AAlvaro J. Rebón Portillo, Kevin Hammond, Hans-Wolfgang Loidl, and Pedro Vasconcelos. Cost analysis using automatic size and time inference. In IFL 2002, volume 2670 of LNCS, pages 232-247, 2003.
24. David Sands. A naïve time analysis and its theory of cost equivalence. Journal of Logic and Computation, 5(4):495-541, 1995.
25. The Agda Team. The Agda Wiki. Available at http://www.cs.chalmers.se/ ~ulfn/Agda/, 2007.
26. Philip Wadler. Strictness analysis aids time analysis. In POPL '88, pages 119-132, 1988.