Controlling Program Extraction in Light Logics

  • Marc Lasson
Conference paper

DOI: 10.1007/978-3-642-21691-6_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6690)
Cite this paper as:
Lasson M. (2011) Controlling Program Extraction in Light Logics. In: Ong L. (eds) Typed Lambda Calculi and Applications. TLCA 2011. Lecture Notes in Computer Science, vol 6690. Springer, Berlin, Heidelberg

Abstract

We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant’s system FA2. This system allows higher-order equations to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms. The system guarantees that the extracted program satisfies the specification and is computable in elementary time (for elementary affine logic) or polynomial time (for light affine logic). Finally, we show that both systems are complete with respect to elementary time and polynomial time functions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Marc Lasson
    • 1
  1. 1.ENS Lyon, Université de Lyon, LIPFrance

Personalised recommendations