Article

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

Authors:

Pedro B. Vasconcelos,

Kevin HammondAuthors Info & Claims

IFL'03: Proceedings of the 15th international conference on Implementation of Functional Languages

Pages 86 - 101

https://doi.org/10.1007/978-3-540-27861-0_6

Published: 08 September 2003 Publication History

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.

References

[1]

T. Amtoft, F. Nielson, and H.R. Nielson. Type and Effect Systems: Behaviours for Concurrency. Imperial College Press, 1999.

Digital Library

[2]

R. Benzinger. Automated Complexity Analysis of Nuprl Extracted Programs. Journal of Functional Programming, 11(1):3-31, 2001.

Digital Library

[3]

W.-N. Chin and S.-C. Khoo. Calculating Sized Types. Higher-Order and Symbolic Computing, 14(2, 3), 2001.

Digital Library

[4]

L. Damas and A.J.R.G. Milner. Principal Type-Schemes for Functional Programs. In Proc. 1982 ACM Symp. on Principles of Prog. Langs. - POPL '82, pages 207- 212, 1982.

Digital Library

[5]

V. Dornic, P. Jouvelot, and D.K. Gifford. Polymorphic Time Systems for Estimating Program Complexity. ACM Letters on Prog. Lang. and Systems, 1(1):33-45, March 1992.

Digital Library

[6]

R.J.M. Hughes, L. Pareto, and A. Sabry. Proving the Correctness of Reactive Systems using Sized Types. In Proc 1996 ACM Symposium on Principles of Programming Languages - POPL '96, St Petersburg, FL, January 1996.

Digital Library

[7]

D. Le Métayer. ACE: An Automatic Complexity Evaluator. ACM Transactions on Programming Languages and Systems, 10(2), April 1988.

Digital Library

[8]

H. Levy and F. Lessman. Finite Difference Equations. Macmillan, 1961.

[9]

H-W. Loidl and K. Hammond. A Sized Time System for a Parallel Functional Language. In Glasgow Workshop on Functional Programming, Ullapool, July 1996.

[10]

A.J.R.G. Milner. A Theory of Type Polymorphism in Programming. J. Computer System Sciences, 17(3):348-375, 1976.

[11]

F. Nielson, H. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.

Digital Library

[12]

Á. Rebón Portillo, K. Hammond, H.-W. Loidl, and P.B. Vasconcelos. Cost Analysis using Automatic Size and Time Inference. In Proc. IFL 2002 - Implementation of Functional Languages, Madrid, Spain, LNCS 2670. Springer-Verlag, 2003.

Digital Library

[13]

B. Reistad and D.K. Gifford. Static Dependent Costs for Estimating Execution Time. In Proc. 1994 ACM Conference on Lisp and Functional Programming - LFP '94, pages 65-78, Orlando, FL, June 1994.

Digital Library

[14]

M. Rosendahl. Automatic Complexity Analysis. In Proc. 1989 Intl. Conf. on Functional Prog. Langs. and Comp. Arch. - FPCA '89, pages 144-156, 1989.

Digital Library

[15]

D.A. Turner. Elementary Strong Functional Programming. In Proc. Symp. on Funct. Prog. Langs. in Education -- FPLE '95, LNCS. Springer-Verlag, Dec. 1995.

Digital Library

[16]

P.B. Vasconcelos and K. Hammond. A Type and Effect System for Costing Recursive, Higher-Order and Polymorphic Functional Programs. In preparation, 2004.

[17]

B. Wegbreit. Mechanical Program Analysis. Comm. of the ACM, 18(9), 1975.

Digital Library

Cited By

Pérez VKlemen MLópez-García PMorales JHermenegildo M(2020)Cost Analysis of Smart Contracts Via Parametric Resource AnalysisStatic Analysis10.1007/978-3-030-65474-0_2(7-31)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-65474-0_2
Nipkow TBrinkop H(2019)Amortized Complexity VerifiedJournal of Automated Reasoning10.1007/s10817-018-9459-362:3(367-391)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s10817-018-9459-3
Accattoli BGraham-Lengrand SKesner D(2018)Tight typings and split boundsProceedings of the ACM on Programming Languages10.1145/32367892:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236789
Show More Cited By

Inferring cost equations for recursive, polymorphic and higher-order functional programs
1. Theory of computation
  1. Semantics and reasoning

Recommendations

Polymorphic higher-order recursive path orderings

This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed lambda-calculus generated by a signature of polymorphic higher-order ...
Using intersection types for cost-analysis of higher-order polymorphic functional programs
TYPES'06: Proceedings of the 2006 international conference on Types for proofs and programs

This paper presents a system of cost derivation for higherorder and polymorphic functional programs based on a notion of sized types and exploiting a type-and-effect system approach. The paper gives an operational semantics of cost for a simple strict ...
Polymorphic higher-order context-free session types
Abstract
We present an extension of polymorphic context-free session types that allows passing channels on channels, commonly known as higher-order session types. The mixture of functional types and session types has proven to be a challenge for type ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

IFL'03: Proceedings of the 15th international conference on Implementation of Functional Languages

September 2003

184 pages

ISBN:3540237275

Editors:
Phil Trinder
Dept. of Mathematics and Comp. Sci., Heriot-Watt University, Edinburgh, UK
,
Greg J. Michaelson
Dept. of Mathematics and Computer Science, Heriot-Watt University, Edinburgh, Scotland
,
Ricardo Peña
Departamento Sistemas Informaticos y Programacin, Facultad de Informatica, Universidad Complutense de Madrid, C/ Juan del Rosal, 8, Madrid, Spain

Sponsors

BCS-FACS

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 September 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pérez VKlemen MLópez-García PMorales JHermenegildo M(2020)Cost Analysis of Smart Contracts Via Parametric Resource AnalysisStatic Analysis10.1007/978-3-030-65474-0_2(7-31)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-65474-0_2
Nipkow TBrinkop H(2019)Amortized Complexity VerifiedJournal of Automated Reasoning10.1007/s10817-018-9459-362:3(367-391)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s10817-018-9459-3
Accattoli BGraham-Lengrand SKesner D(2018)Tight typings and split boundsProceedings of the ACM on Programming Languages10.1145/32367892:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236789
Klinik MJansen JPlasmeijer R(2017)The Sky is the LimitProceedings of the 29th Symposium on the Implementation and Application of Functional Programming Languages10.1145/3205368.3205376(1-12)Online publication date: 30-Aug-2017
https://dl.acm.org/doi/10.1145/3205368.3205376
Wang PWang DChlipala A(2017)TiML: a functional language for practical complexity analysis with invariantsProceedings of the ACM on Programming Languages10.1145/31339031:OOPSLA(1-26)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133903
Hoffmann JDas AWeng S(2017)Towards automatic resource bound analysis for OCamlACM SIGPLAN Notices10.1145/3093333.300984252:1(359-373)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009842
Georgiou KKerrison SChamski ZEder K(2017)Energy Transparency for Deeply Embedded ProgramsACM Transactions on Architecture and Code Optimization10.1145/304667914:1(1-26)Online publication date: 21-Mar-2017
https://dl.acm.org/doi/10.1145/3046679
Klinik MHage JJansen JPlasmeijer RSchultz UYallop J(2017)Predicting resource consumption of higher-order workflowsProceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3018882.3018885(99-110)Online publication date: 2-Jan-2017
https://dl.acm.org/doi/10.1145/3018882.3018885
Hoffmann JDas AWeng SCastagna GGordon A(2017)Towards automatic resource bound analysis for OCamlProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009842(359-373)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009842
Çiçek EParaskevopoulou ZGarg D(2016)A type theory for incremental computational complexity with control flow changesACM SIGPLAN Notices10.1145/3022670.295195051:9(132-145)Online publication date: 4-Sep-2016
https://dl.acm.org/doi/10.1145/3022670.2951950
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents