TYPES
13 years 10 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...
TYPES
13 years 10 months ago
2004 Springer TYPES
13 years 10 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...
TYPES
13 years 10 months ago
2004 Springer 
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
TYPES
13 years 10 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 ...
|
Formal Methods