A dependently typed framework for static analysis of program execution costs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4015 LNCS, Issue , 2006, Pages 74-90

  Brady, Edwin ^a   Hammond, Kevin ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENT TYPES; DYNAMIC RESOURCES; HIGHER ORDER FUNCTIONS; PROGRAM EXECUTION; SIZE METRICS; STATIC TYPE SYSTEMS;

RECURSIVE FUNCTIONS;

STATIC ANALYSIS;

EID: 77957299607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11964681_5     Document Type: Conference Paper

References (29)

1. T. Altenkirch, C. McBride, and J. McKinna. Why dependent types matter, 2005. Submitted for publication.
2. L. Augustsson. Cayenne-a language with dependent types. In Proc. ACM SIGPLAN International Conf. on Functional Programming (ICFP '98), volume 34(1) of ACM SIGPLAN Notices, pages 239-250. ACM, June 1999.
3. L. Augustsson and M. Carlsson. An exercise in dependent types: A well-typed interpreter, 1999.
4. E. Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
5. R. Burstall. Inductively Defined Functions in Functional Programming Languages. Technical Report ECS-LFCS-87-25, Dept. of Comp. Sci., Univ. of Edinburgh, April 1987.
6. Coq Development Team. The Coq proof assistant-reference manual. http://coq.inria.fr/, 2004.
7. K. Crary and S. Weirich. Resource bound certification. In the Symposium on Principles of Programming Languages (POPL '00), pages 184-198, N.Y., Jan. 19-21 2000. ACM Press.
8. H. B. Curry and R. Feys. Combinatory Logic, volume 1. North Holland, 1958.
9. P. Dybjer. Inductive families. Formal Aspects of Computing, 6(4):440-465, 1994.
10. B. Grobauer. Topics in Semantics-based Program Manipluation. PhD thesis, BRICS, Department of Computer Science, University of Aarhus, August 2001.
11. K. Hammond and G. Michaelson. Hume: a Domain-Specific Language for Real-Time Embedded Systems. In Proc. Conf. Generative Programming and Component Engineering (GPCE '03), Lecture Notes in Computer Science. Springer-Verlag, 2003.
12. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In Proc. POPL 2003-2003 ACM Symp. on Principles of Programming Languages, pages 185-197. ACM, 2003.
13. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B.Curry: Essays on combinatory logic, lambda calculus and formalism. Academic Press, 1980. A reprint of an unpublished manuscript from 1969.
14. R. Hughes and L. Pareto. Recursion and Dynamic Data Structures in Bounded Space: Towards Embedded ML Programming. In Proc. 1999 ACM Intl. Conf. on Functional Programming (ICFP '99), pages 70-81, 1999.
15. R. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proc. ACM Symp. on Principles of Prog. Langs. (POPL '96). ACM Press, 1996.
16. Z. Luo. Computation and Reasoning-A Type Theory for Computer Science. International Series of Monographs on Computer Science. OUP, 1994.
17. Z. Luo and R. Pollack. LEGO proof development system: User's manual. Technical report, Department of Computer Science, University of Edinburgh, 1992.
18. C. McBride. Dependently Typed Functional Programs and their proofs. PhD thesis, University of Edinburgh, May 2000.
19. C. McBride. Epigram: Practical programming with dependent types. Lecture Notes, International Summer School on Advanced Functional Programming, 2004.
20. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004.
21. P. Morris, C. McBride, and T. Altenkirch. Exploring the regular tree types. In Types for Proofs and Programs 2004, 2005.
22. A. Mycroft and R. Sharp. A statically allocated parallel functional language. In Automata, Languages and Programming, pages 37-48, 2000.
23. W. Pugh. The Omega Test: a fast and practical integer programming algorithm for dependence analysis. Communication of the ACM, pages 102-114, 1992.
24. A. Rebón Portillo, K. Hammond, H.-W. Loidl, and P. Vasconcelos. A Sized Time System for a Parallel Functional Language (Revised). In Proc. Implementation of Functional Langs.(IFL '02), Madrid, Spain, number 2670 in Lecture Notes in Computer Science. Springer-Verlag, 2003.
25. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1 Feb. 1997.
26. D. Turner. Elementary Strong Functional Programming. In Proc. 1995 Symp. on Functl. Prog. Langs. in Education-FPLE '95, LNCS. Springer-Verlag, Dec. 1995.
27. Z.Wan,W. Taha, and P. Hudak. Real-time FRP. In Proc. Intl. Conf. on Functional Programming (ICFP '01), Florence, Italy, September 2001. ACM.
28. Z. Wan, W. Taha, and P. Hudak. Event-driven FRP. In Proc. 4th. Intl. Sym. on Practical Aspects of Declarative Languages (PADL '02). ACM, Jan 2002.
29. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 249-257, Montreal, June 1998.