Add to ORKGWe propose a new approach to the computer-assisted verification of functional programs. We work in first order theories of functional programs which are obtained by extending Aczel?s first order theory of combinatory formal arithmetic with positive induc
It is often claimed that functional programming languages, and in particular pure functional langua...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
Functional programming languages such as Haskell or ML allow the programmer to implement and to use ...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
We propose a new approach to computer-assisted verification of lazy functional programs where funct...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
The interactive verification system VeriFun is based on a polymorphic call-by-value functional langu...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
We address in this paper the question of how to verify pro-gram properties in modern functional logi...
Whereas early researchers in computability theory described effective computability in terms of such...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
It is often claimed that functional programming languages, and in particular pure functional langua...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
Functional programming languages such as Haskell or ML allow the programmer to implement and to use ...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
We propose a new approach to computer-assisted verification of lazy functional programs where funct...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
The interactive verification system VeriFun is based on a polymorphic call-by-value functional langu...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
We address in this paper the question of how to verify pro-gram properties in modern functional logi...
Whereas early researchers in computability theory described effective computability in terms of such...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
It is often claimed that functional programming languages, and in particular pure functional langua...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
Functional programming languages such as Haskell or ML allow the programmer to implement and to use ...