Add to ORKGagda2hs is a project that aims to combine the best parts of Haskell and Agda by providing a common subset between them. It allows programmers to im- plement libraries in Agda, verify their correctness and then translate the result to Haskell so they can be used by Haskell programmers. In this paper, a verified Agda implementation of the Ranged-sets Haskell library is provided, using agda2hs. In or- der to produce a verified implementation of this li- brary, we proved its preconditions, invariants and properties.CSE3000 Research ProjectComputer Science and Engineerin
When designing critical software, great care must be taken to guarantee its correctness. Refactoring...
We develop a theoretical foundation for compiling the programming language Agda to System Fω, which ...
Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical sy...
Purely functional languages are advantageous in that it is easy to reason about the correctness of f...
Agda2hs is a program which compiles a subset of Agda to Haskell. In this paper, an implementation of...
Agda allows for writing code that can be mathematically proven and verified to be correct, this type...
Equational reasoning based verification address some of the limitations of classical testing. The Cu...
The formal verification of concurrent programs is of particular importance, because concurrent progr...
Formal verification works better than testing, since the correctness of a program is proven. It is r...
Agda2hs is a tool that allows developers to write verified programs using Agda and then translate th...
Formal verification of software is a largely underrepresented discipline in practice. While it is no...
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
agda2hs is a tool which translates a subset of Agda to readable Haskell. Using agda2hs, programmers ...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
When designing critical software, great care must be taken to guarantee its correctness. Refactoring...
We develop a theoretical foundation for compiling the programming language Agda to System Fω, which ...
Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical sy...
Purely functional languages are advantageous in that it is easy to reason about the correctness of f...
Agda2hs is a program which compiles a subset of Agda to Haskell. In this paper, an implementation of...
Agda allows for writing code that can be mathematically proven and verified to be correct, this type...
Equational reasoning based verification address some of the limitations of classical testing. The Cu...
The formal verification of concurrent programs is of particular importance, because concurrent progr...
Formal verification works better than testing, since the correctness of a program is proven. It is r...
Agda2hs is a tool that allows developers to write verified programs using Agda and then translate th...
Formal verification of software is a largely underrepresented discipline in practice. While it is no...
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
agda2hs is a tool which translates a subset of Agda to readable Haskell. Using agda2hs, programmers ...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
When designing critical software, great care must be taken to guarantee its correctness. Refactoring...
We develop a theoretical foundation for compiling the programming language Agda to System Fω, which ...
Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical sy...