Inferring cost equations for recursive, polymorphic and higher-order functional programs

Authors:
Pedro B. Vasconcelos;Kevin Hammond
Affiliations:
School of Computer Science, University of St Andrews, St Andrews, UK;School of Computer Science, University of St Andrews, St Andrews, UK
Venue:
IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
Year:
2003

Citing 13
Cited 19

ACE: an automatic complexity evaluator

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic complexity analysis

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Polymorphic time systems for estimating program complexity

ACM Letters on Programming Languages and Systems (LOPLAS)
Static dependent costs for estimating execution time

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mechanical program analysis

Communications of the ACM
Calculating Sized Types

Higher-Order and Symbolic Computation
Principles of Program Analysis

Principles of Program Analysis
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Elementary Strong Functional Programming

FPLE '95 Proceedings of the First International Symposium on Functional Programming Languages in Education
Type and Effect Systems

Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Automated complexity analysis of Nuprl extracted programs

Journal of Functional Programming
Cost analysis using automatic size and time inference

IFL'02 Proceedings of the 14th international conference on Implementation of functional languages

FSM-Hume: programming resource-limited systems using bounded automata

Proceedings of the 2004 ACM symposium on Applied computing
Towards formally verifiable resource bounds for real-time embedded systems

ACM SIGBED Review - Special issues on workshop on innovative techniques for certification of embedded systems
Towards resource-certified software: a formal cost model for time and its application to an image-processing example

Proceedings of the 2007 ACM symposium on Applied computing
Experiments in Cost Analysis of Java Bytecode

Electronic Notes in Theoretical Computer Science (ENTCS)
Heap space analysis for java bytecode

Proceedings of the 6th international symposium on Memory management
Inferring Static Non-monotone Size-aware Types Through Testing

Electronic Notes in Theoretical Computer Science (ENTCS)
Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Amortised Memory Analysis Using the Depth of Data Structures

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
User-Definable Resource Usage Bounds Analysis for Java Bytecode

Electronic Notes in Theoretical Computer Science (ENTCS)
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Static determination of quantitative resource usage for higher-order programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Low-level programming in Hume: an exploration of the HW-Hume level

IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
Worst-case execution times for a purely functional language

IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
Polynomial size analysis of first-order functions

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
User-definable resource bounds analysis for logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
The Peter Landin prize

Higher-Order and Symbolic Computation
Improvements to a resource analysis for hume

FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Mobile resource guarantees and policies

CASSIS'05 Proceedings of the Second international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Automatic amortised analysis of dynamic memory allocation for lazy functional programs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a type-based analysis for inferring size- and cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annotations or unusual syntax. Our type reconstruction algorithm is capable of inferring first-order cost equations for a non-trivial subset of higher-order, recursive and polymorphic functions. We illustrate the approach with reference to some standard examples of recursive programs.