<?xml version="1.0" encoding="UTF-8"?>
<b:Sources SelectedStyle="" xmlns:b="http://schemas.openxmlformats.org/officeDocument/2006/bibliography"  xmlns="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" >
<b:Source>
<b:Tag>brucker.ea:embedding:2003</b:Tag>
<b:SourceType>BookSection</b:SourceType>
<b:City>Heidelberg</b:City>
<b:Publisher>Springer-Verlag</b:Publisher>
<b:Year>2003</b:Year>
<b:ConferenceName>Types for Proof and Programs</b:ConferenceName>
<b:Issue>2646</b:Issue>
<b:Pages>59-77</b:Pages>
<b:Author>
<b:Author><b:NameList>
<b:Person><b:Last>Brucker</b:Last><b:First>Achim</b:First><b:Middle>D</b:Middle></b:Person>
<b:Person><b:Last>Wolff</b:Last><b:First>Burkhart</b:First></b:Person>
</b:NameList></b:Author>
<b:Editor><b:NameList>
<b:Person><b:Last>Geuvers</b:Last><b:First>Herman</b:First></b:Person>
<b:Person><b:Last>Wiedijk</b:Last><b:First>Freek</b:First></b:Person>
</b:NameList></b:Editor>
</b:Author>
<b:Title>Using Theory Morphisms for Implementing Formal Methods Tools</b:Title>
<b:Comments>Tools for a specification language can be implemented directly (by building a special purpose theorem prover) or by a conservative embedding into a typed meta-logic, which allows their safe and logically consistent implementation and the reuse of existing theorem prover engines. For being useful, the conservative extension approach must provide derivations for several thousand &#8220;folklore&#8221; theorems. In this paper, we present an approach for deriving the mass of these theorems mechanically from an existing library of the meta-logic. The approach presupposes a structured theory morphism mapping library datatypes and library functions to new functions of the specification language while uniformly modifying some semantic properties; for example, new functions may have a different treatment of undefinedness compared to old ones.</b:Comments>
</b:Source>
</b:Sources>

