Results 1 
4 of
4
Proof by Pointing
, 1994
"... This paper presents a principle for using locations in logical expressions to guide the process of building proofs. Using a sequentstyle presentation of theorem provers, we annotate the inference rules to specify an algorithm that associates the construction of a proof tree to a location within ..."
Abstract

Cited by 40 (8 self)
 Add to MetaCart
This paper presents a principle for using locations in logical expressions to guide the process of building proofs. Using a sequentstyle presentation of theorem provers, we annotate the inference rules to specify an algorithm that associates the construction of a proof tree to a location within a goal sequent. This principle provides a natural and effective use of the mouse in the userinterface of computer proof assistants. The implementation of the algorithm in a variety of theorem provers is discussed.
1 + 1 = 1: an optimizing Caml compiler
 IN ACMSIGPLAN WORKSHOP ON ML AND ITS APPLICATIONS
, 1994
"... We present a new Caml compiler, which was obtained by an original approach: a simple pipeline between two existing compilers, each one devoted to half of the compilation process. The first compiler is a Caml compiler, it is in charge of the front end, and ensures compatibility. The second compiler i ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We present a new Caml compiler, which was obtained by an original approach: a simple pipeline between two existing compilers, each one devoted to half of the compilation process. The first compiler is a Caml compiler, it is in charge of the front end, and ensures compatibility. The second compiler is an optimizing Scheme compiler, it constitutes the back end, and ensures efficiency. These are Caml Light 0.6 bytecode compiler and a Scheme compiler (Bigloo). Using this technology, we were able to write the optimizing compiler in only two manmonths. The new compiler is bootstrapped, fully compatible with the Caml Light 0.6 compiler, and features interesting intermodule optimizations for curried functions. It produces efficient code, comparable with the one produced by other ML compilers (including SML/NJ). Our new compiler, Bigloo, is freely available.
Dependency Graphs for Interactive Theorem Provers
, 2000
"... We propose tools to visualize large proof developments as graphs of theorems and definitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover [DFH + 93] and the GraphViz [EGKN] an ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We propose tools to visualize large proof developments as graphs of theorems and definitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover [DFH + 93] and the GraphViz [EGKN] and daVinci [FW98] graph visualization suites.