Indexed realizability for bounded-time programming with references and type fixpoints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Programming Languages and Systems - 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11 - December 13, 2012. Proceedings Année : 2012

Indexed realizability for bounded-time programming with references and type fixpoints

Résumé

The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We here present a realizability semantics for a higher-order functional language based on a fragment of linear logic called LAL which characterizes the complexity class PTIME. This language features recursive types and higher-order store. Our realizability is based on biorthogonality, step-indexing and is moreover quantitative. This last feature enables us not only to derive a semantical proof of termination, but also to give bounds on the number of computational steps needed by typed programs to terminate.

Dates et versions

hal-00735584 , version 1 (26-09-2012)

Identifiants

Citer

Aloïs Brunel, Antoine Madet. Indexed realizability for bounded-time programming with references and type fixpoints. 10th Asian Symposium on Programming Languages and Systems, Dec 2012, Kyoto, Japan. pp.264-279. ⟨hal-00735584⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More