Results 141 to 150 of about 12,151 (175)
Some of the next articles are maybe not open access.
2014
Universes are used in Type Theory to ensure consistency by checking that definitions are well-stratified according to a certain hierarchy. In the case of the Coq proof assistant, based on the predicative Calculus of Inductive Constructions (pCIC), this hierachy is built from an impredicative sort Prop and an infinite number of predicative Type_i ...
Sozeau, Matthieu, Tabareau, Nicolas
openaire +2 more sources
Universes are used in Type Theory to ensure consistency by checking that definitions are well-stratified according to a certain hierarchy. In the case of the Coq proof assistant, based on the predicative Calculus of Inductive Constructions (pCIC), this hierachy is built from an impredicative sort Prop and an infinite number of predicative Type_i ...
Sozeau, Matthieu, Tabareau, Nicolas
openaire +2 more sources
Programming with Effects in Coq
2008Next-generation programming languages will move beyond simple type systems to include support for formal specifications and mechanically- checked proofs of adherence to those requirements. Already, in the imperative world, languages such as ESC/Java and Spec # integrate Hoare- style pre- and post-conditions into the underlying type system.
openaire +1 more source
2008
The Coq proof assistant has been developed at INRIA, Ecole Normale Superieure de Lyon, and University of Paris South for more than twenty years [6]. Its theoretical foundation is known as the "Calculus of Inductive Constructions" [4,5]. Versions of the system were distributed regularly from 1989 (version 4.10).
openaire +1 more source
The Coq proof assistant has been developed at INRIA, Ecole Normale Superieure de Lyon, and University of Paris South for more than twenty years [6]. Its theoretical foundation is known as the "Calculus of Inductive Constructions" [4,5]. Versions of the system were distributed regularly from 1989 (version 4.10).
openaire +1 more source
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016
The Coq proof assistant is increasingly used for constructing verified software, including everything from verified microkernels to verified databases. Programmers typically write code in Gallina (the core functional language of Coq) and construct proofs about those Gallina programs.
openaire +1 more source
The Coq proof assistant is increasingly used for constructing verified software, including everything from verified microkernels to verified databases. Programmers typically write code in Gallina (the core functional language of Coq) and construct proofs about those Gallina programs.
openaire +1 more source
2006
Surreal Numbers form a totally ordered (commutative) Field, containing copies of the reals and (all) the ordinals. I have encoded most of the Ring structure of surreal numbers in Coq. This encoding relies on Aczel's encoding of set theory in type theory.
openaire +2 more sources
Surreal Numbers form a totally ordered (commutative) Field, containing copies of the reals and (all) the ordinals. I have encoded most of the Ring structure of surreal numbers in Coq. This encoding relies on Aczel's encoding of set theory in type theory.
openaire +2 more sources
Modules in Coq Are and Will Be Correct
2004The paper presents the system of named modules implemented in Coq version 7.4 and shows that this extension is conservative. It is also shown that the implemented module system is ready for the future planned extension of Coq with definitions of functions by means of rewrite rules.
openaire +1 more source
2007
We propose a new language for writing programs with dependent types on top of the Coq proof assistant. This language permits to establish a phase distinction between writing and proving algorithms in the Coq environment. Concretely, this means allowing to write algorithms as easily as in a practical functional programming language whilst giving them as
openaire +1 more source
We propose a new language for writing programs with dependent types on top of the Coq proof assistant. This language permits to establish a phase distinction between writing and proving algorithms in the Coq environment. Concretely, this means allowing to write algorithms as easily as in a practical functional programming language whilst giving them as
openaire +1 more source
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W), 2022
Avraham Shinnar, Barry M. Trager
openaire +1 more source
Avraham Shinnar, Barry M. Trager
openaire +1 more source
Predicting and Understanding the Pathology of Single Nucleotide Variants in Human COQ Genes
Antioxidants, 2022Sining Wang +2 more
exaly
Coq3p relevant residues for protein activity and stability
FEMS Yeast Research, 2021Janaina A Paulela +2 more
exaly