Results 1 to 10 of about 23,621 (170)
Coq Coq correct! verification of type checking and erasure for Coq, in Coq [PDF]
Coq is built around a well-delimited kernel that perfoms typechecking for definitions in a variant of the Calculus of Inductive Constructions (CIC). Although the metatheory of CIC is very stable and reliable, the correctness of its implementation in Coq is less clear.
Sozeau, Matthieu +4 more
openaire +4 more sources
Extracting functional programs from Coq, in Coq
Abstract We implement extraction of Coq programs to functional languages based on MetaCoq’s certified erasure. We extend the MetaCoq erasure output language with typing information and use it as an intermediate representation, which we call
Danil Annenkov +3 more
openaire +4 more sources
We propose a formalization in Coq of HOπ , a process calculus where messages carry processes. Such a higher-order calculus features two very different kinds of binder: process input, similar to λ-abstraction, and name restriction, whose scope can be expanded by communication.
Lenglet, Sergueï, Schmitt, Alan
openaire +2 more sources
We consider a recent publication on higher-order process calculi and describe how its main results have been formalized in the Coq proof assistant. We highlight a number of important technical issues that we have uncovered in the original publication.
Maksimovic, Petar, Schmitt, Alan
openaire +3 more sources
An Implementation of Deflate in Coq [PDF]
The widely-used compression format "Deflate" is defined in RFC 1951 and is based on prefix-free codings and backreferences. There are unclear points about the way these codings are specified, and several sources for confusion in the standard. We tried to fix this problem by giving a rigorous mathematical specification, which we formalized in Coq.
Christoph-Simon Senjak +1 more
openaire +3 more sources
The Coq Proof Script Visualiser (coq-psv)
In this work, we present a visualisation tool that is able to process Coq proof scripts and generate a table representation of the contained proofs as $\LaTeX$ or PDF files. This tool has the aim to support both education and review processes as all proof steps can be visualised.
openaire +3 more sources
Structural operational semantics provides a well known framework to describe the semantics of programming languages, lending itself to formalization in theorem provers. The formalization of syntactic SOS rule formats, which enforce some form of well-behavedness, has so far received less attention. GSOS is a rule format that enjoys the property that the
Madlener, K., Smetsers, S.
openaire +3 more sources
We present a formalization of HOπ in Coq, a process calculus where messages carry processes. Such a higher-order calculus features two very different kinds of binder: process input, similar to λ-abstraction, and name restriction, whose scope can be expanded by communication.
Ambal, Guillaume +2 more
openaire +2 more sources
A Formalization of Operads in Coq
What provides the highest level of assurance for correctness of execution within a programming language? One answer, and our solution in particular, to this problem is to provide a formalization for, if it exists, the denotational semantics of a programming language.
Zachary Flores +3 more
openaire +3 more sources
Journal of Formalized Reasoning; Vol 3, No 1 (2010); 29 ...
openaire +2 more sources

