Results 131 to 140 of about 23,621 (170)
Some of the next articles are maybe not open access.
Proceedings of the ACM SIGPLAN workshop on Generic programming, 2008
The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs. For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the definition in Generic Haskell.
Wendy Verbruggen +2 more
openaire +1 more source
The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs. For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the definition in Generic Haskell.
Wendy Verbruggen +2 more
openaire +1 more source
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, 2013
We describe a Coq formalization of a subset of the x86 architecture. One emphasis of the model is brevity: using dependent types, type classes and notation we give the x86 semantics a makeover that counters its reputation for baroqueness. We model bits, bytes, and memory concretely using functions that can be computed inside Coq itself; concrete ...
Andrew Kennedy +3 more
openaire +3 more sources
We describe a Coq formalization of a subset of the x86 architecture. One emphasis of the model is brevity: using dependent types, type classes and notation we give the x86 semantics a makeover that counters its reputation for baroqueness. We model bits, bytes, and memory concretely using functions that can be computed inside Coq itself; concrete ...
Andrew Kennedy +3 more
openaire +3 more sources
2004
The need for formal methods for certifying the good behaviour of computer software is dramatically increasing with the growing complexity of the latter. Moreover, in the global computing framework one must face the additional issues of concurrency and mobility.
HONSELL, Furio, SCAGNETTO, Ivan
openaire +1 more source
The need for formal methods for certifying the good behaviour of computer software is dramatically increasing with the growing complexity of the latter. Moreover, in the global computing framework one must face the additional issues of concurrency and mobility.
HONSELL, Furio, SCAGNETTO, Ivan
openaire +1 more source
2019
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistant, provides a cost-effective way to implement a powerful system for verifying correctness of program transformations, but their ...
Kosuke Murata, Kento Emoto
openaire +1 more source
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistant, provides a cost-effective way to implement a powerful system for verifying correctness of program transformations, but their ...
Kosuke Murata, Kento Emoto
openaire +1 more source
2007
Equational reasoning in Coq is not straightforward. For a few years now there has been an ongoing research process towards adding rewriting to Coq. However, there are many research problems on this way. In this paper we give a coherent view of rewriting in Coq, we describe what is already done and what remains to be done.
Jacek Chrzaszcz +1 more
openaire +2 more sources
Equational reasoning in Coq is not straightforward. For a few years now there has been an ongoing research process towards adding rewriting to Coq. However, there are many research problems on this way. In this paper we give a coherent view of rewriting in Coq, we describe what is already done and what remains to be done.
Jacek Chrzaszcz +1 more
openaire +2 more sources
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 +3 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 +3 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 +2 more sources
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
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