138
click to vote
TYPES
15 years 7 months ago
2004 Springer 
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...
122
click to vote
TYPES
15 years 7 months ago
2004 Springer 
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...
121
click to vote
TYPES
15 years 7 months ago
2004 Springer 
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
117
click to vote
TYPES
15 years 7 months ago
2004 Springer
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 ...
113
click to vote
TYPES
15 years 7 months ago
2004 Springer
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...
|
Formal Methods