Results 141 to 150 of about 23,621 (170)
Some of the next articles are maybe not open access.
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
Predicting and Understanding the Pathology of Single Nucleotide Variants in Human COQ Genes
Antioxidants, 2022Catherine F. Clarke +2 more
exaly
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
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
A Sensitive Mass Spectrometric Assay for Mitochondrial CoQ Pool Redox State in Vivo
Free Radical Biology and Medicine, 2020Andrew M James +2 more
exaly
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
Coq3p Relevant Residues for Protein Activity and Stability.
FEMS Yeast Research, 2021Jose Ribamar Ferreira-Junior +2 more
exaly
Practical Proof Search for Coq by Type Inhabitation
Lecture Notes in Computer Science, 2020Łukasz Czajka
exaly