Complexity Analysis in Presence of Control Operators and Higher-Order Functions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Complexity Analysis in Presence of Control Operators and Higher-Order Functions

Résumé

A polarized version of Girard, Scedrov and Scott's Bounded Linear Logic is introduced and its normalization properties studied. Following Laurent, the logic naturally gives rise to a type system for the lambda-mu-calculus, whose derivations reveal bounds on the time complexity of the underlying term. This is the first example of a type system for the lambda-mu-calculus guaranteeing time complexity bounds for typable programs.

Domaines

Informatique
Fichier principal
Vignette du fichier
lpar2013.pdf (228.75 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00909319 , version 1 (26-11-2013)

Identifiants

Citer

Ugo Dal Lago, Giulio Pellitta. Complexity Analysis in Presence of Control Operators and Higher-Order Functions. LPAR-19 - Logic for Programming, Artificial Intelligence, and Reasoning - 2013, 2013, Stellenbosch, South Africa. pp.258-273, ⟨10.1007/978-3-642-45221-5_19⟩. ⟨hal-00909319⟩

Collections

INRIA INRIA2
77 Consultations
88 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More