<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T01:29:26Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/28050" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/28050</identifier><datestamp>2026-09-24T02:02:18Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Farmer, William. M.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Ray, Lekhani</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-10-27T01:29:50Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-10-27T01:29:50Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/28050</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/18383</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A biform theory is a combination of an axiomatic theory and an algorithmic&#xd;
theory. It is used to integrate reasoning and computation in a common theory and&#xd;
can include algorithms with precisely specified input-output relationships. Isabelle&#xd;
is one of the leading interactive theorem provers. Isabelle includes locales, a module&#xd;
system that uses theory morphisms to manage theory hierarchies, and that has a rich&#xd;
and extensive library with multiple useful proof and formalization techniques. A case&#xd;
study of eight biform theories of natural number arithmetic is described in the paper&#xd;
“Formalizing Mathematical Knowledge as a Biform Theory Graph” by J. Carette&#xd;
and W. M. Farmer. The biform theories form a graph linked by theory morphisms.&#xd;
Seven of the biform theories are in first-order logic and one is in simple type theory.&#xd;
The purpose of this thesis is to test how a theory graph of biform theories can be&#xd;
formalized in Isabelle by attempting to formalize this case study. We work with&#xd;
locales and sublocales in Isabelle to formalize the test case. The eight biform theories&#xd;
are defined as regular axiomatic theories, while the algorithms are functions defined&#xd;
on inductive types representing the syntax of the theories.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Isabelle, Formal Methods, Biform theory</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Formalization of Biform Theories in Isabelle</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>