
Denotational recurrence extraction for amortized analysis
A typical way of analyzing the time complexity of functional programs is...
read it

The Weak CallByValue λCalculus is Reasonable for Both Time and Space
We study the weak callbyvalue λcalculus as a model for computational ...
read it

The Bang Calculus Revisited
CallbyPushValue (CBPV) is a programming paradigm subsuming both Call...
read it

Eliminating the unit constant in the Lambek calculus with brackets
We present a translation of the Lambek calculus with brackets and the un...
read it

Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
The logical depth of a reversible Turing machine equals the shortest ru...
read it

A polynomial time algorithm for the Lambek calculus with brackets of bounded order
Lambek calculus is a logical foundation of categorial grammar, a linguis...
read it

Quantifiers metamorphoses. Generalizations, variations, algorithmic semantics
This article contains ideas and their elaboration for quantifiers, which...
read it
A certifying extraction with time bounds from Coq to callbyvalue λcalculus
We provide a plugin extracting Coq functions of simple polymorphic types to the (untyped) callbyvalue λ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 Lterm obtained as extraction from the Coq definition of a stepindexed selfinterpreter for Ł, a manyreduction from solvability of Diophantine equations to the halting problem of L, and a polynomialtime simulation of Turing machines in L.
READ FULL TEXT
Comments
There are no comments yet.