Static Complexity Analysis of Higher Order Programs

James Emil Avery, Lars Kristiansen, Jean-Yves Moyen

Abstract

The overall goal of the research presented in this paper is to find^Mautomatic methods for static complexity analysis of higher order^Mprograms.
Original languageEnglish
Title of host publicationFOPARA 2009 : Preliminary Proceedings
EditorsMarko van Eekelen, Shkaravska Olha
Number of pages16
Publication date2009
Pages34-49
Publication statusPublished - 2009
EventInternational Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA '09) - Eindhoven, Netherlands
Duration: 3 Nov 20093 Nov 2009
Conference number: 3

Conference

ConferenceInternational Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA '09)
Number3
Country/TerritoryNetherlands
CityEindhoven
Period03/11/200903/11/2009

Fingerprint

Dive into the research topics of 'Static Complexity Analysis of Higher Order Programs'. Together they form a unique fingerprint.

Cite this