Add to ORKGAbstract. ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The language is separated into two components: a proof language in which (inductive) proofs can be encoded as (total recursive) functions that are erased before execution, and a programming language for constructing programs to be evaluated. This separation enables a paradigm that combines programming with theorem proving. In this paper, we illustrate by example how this programming paradigm is supported in ATS.
To spread the use of formal methods, a language must appeal to programmers, mathematicians and logic...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
Logic programming languages have many characteristics that indicate that they should serve as good i...
The framework Pure Type System (PTS) offers a simple and general approach to designing and formalizi...
In their work on ATS [CX05] and ATSLF [CX04], the authors present an ML-like language which distingu...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
The goals of the project described in this thesis are twofold. First, we wanted to demonstrate that ...
this paper is to investigate the impact on the design of a programming language of tight integration...
ABSTRACT. Logic can be defined as the formal study of reasoning; if we replace "for-mal &am...
This paper presents how to automatically prove that an "optimized " program is correct wit...
We present a type system that can effectively facilitate the use of types in capturing invariants in...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
International audienceDeductive program verification is making fast progress these days. One of the ...
To spread the use of formal methods, a language must appeal to programmers, mathematicians and logic...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
Logic programming languages have many characteristics that indicate that they should serve as good i...
The framework Pure Type System (PTS) offers a simple and general approach to designing and formalizi...
In their work on ATS [CX05] and ATSLF [CX04], the authors present an ML-like language which distingu...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
The goals of the project described in this thesis are twofold. First, we wanted to demonstrate that ...
this paper is to investigate the impact on the design of a programming language of tight integration...
ABSTRACT. Logic can be defined as the formal study of reasoning; if we replace "for-mal &am...
This paper presents how to automatically prove that an "optimized " program is correct wit...
We present a type system that can effectively facilitate the use of types in capturing invariants in...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
International audienceDeductive program verification is making fast progress these days. One of the ...
To spread the use of formal methods, a language must appeal to programmers, mathematicians and logic...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
Logic programming languages have many characteristics that indicate that they should serve as good i...