DeepAI AI Chat
Log In Sign Up

A certifying extraction with time bounds from Coq to call-by-value λ-calculus

by   Yannick Forster, et al.

We provide a plugin extracting Coq functions of simple polymorphic types to the (untyped) call-by-value λ-calculus L. The plugin is implemented in the MetaCoq framework and entirely written in Coq. We provide Ltac tactics to automatically verify the extracted terms w.r.t a logical relation connecting Coq functions with correct extractions and time bounds, essentially performing a certifying translation and running time validation. We provide three case studies: A universal L-term obtained as extraction from the Coq definition of a step-indexed self-interpreter for Ł, a many-reduction from solvability of Diophantine equations to the halting problem of L, and a polynomial-time simulation of Turing machines in L.


page 6

page 7

page 8

page 13

page 14

page 15


Denotational recurrence extraction for amortized analysis

A typical way of analyzing the time complexity of functional programs is...

The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space

We study the weak call-by-value λ-calculus as a model for computational ...

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)

The main way of analyzing the complexity of a program is that of extract...