Realizability Interpretation and Normalization of Typed Call-by-Need λ\lambda-calculus With Control

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need \lambda$-$calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. In a second step, we extend the proof to a call-by-need \lambda$$-calculus equipped with a type system equivalent to classical second-order predicate logic, representing one step towards proving the normalization of the call-by-need classical second-order arithmetic introduced by the second author to provide a proof-as-program interpretation of the axiom of dependent choice

Artifact and Appendix of "RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types"

This is the artifact for the PLDI'21 paper "RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types". It contains the RefinedC tool including its Coq development and the appendix for the paper. Copyright: Creative Commons Attribution 4.0 International Open Acces

Artifact and Appendix of "RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types"

This is the artifact for the PLDI'21 paper "RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types". It contains the RefinedC tool including its Coq development and the appendix for the paper. Copyright: Creative Commons Attribution 4.0 International Open Acces

Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control

International audienceWe define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need λ-calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. In a second step, we extend the proof to a call-by-need λ-calculus equipped with a type system equivalent to classical second-order predicate logic, representing one step towards proving the normalization of the call-by-need classical second-order arithmetic introduced by the second author to provide a proof-as-program interpretation of the axiom of dependent choice