Sciweavers

TYPES
2004
Springer
13 years 11 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
TYPES
2004
Springer
13 years 11 months ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff
TYPES
2004
Springer
13 years 11 months ago
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis
Yves Bertot, Benjamin Grégoire, Xavier Lero...
TYPES
2004
Springer
13 years 11 months ago
A Content Based Mathematical Search Engine: Whelp
Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The ...
Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti...
TYPES
2004
Springer
13 years 11 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
Formal Methods
Top of PageReset Settings