Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can mode...
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
Paula R. Ribeiro, Marco Antonio Barbosa, Luí...
Abstract Within a framework of correct code-generation from HOLspeciļ¬cations, we present a particular instance concerned with the optimized compilation of a lazy language (called...