<?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-21T02:03:00Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/33480" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/33480</identifier><datestamp>2026-08-25T07:08:07Z</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">Carette, Jacques</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">An, Nan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-08-24T15:34:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/11375/33480</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/2264</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Dependent types are commonly presented as a foundation for program verification, enabling precise specifications and machine-checked proofs of correctness. In practice, however, much of the intellectual effort in formal methods is spent not on proving properties of programs, but on modelling: deciding how a domain should be structured, which distinctions should be represented, and which constraints should be enforced explicitly.

This thesis investigates dependent types as a modelling medium, rather than primarily as a verification technology. The central claim is that dependent typing can reshape domain models by forcing structural assumptions, invariants, and semantic commitments to be made explicit, and that the benefits and costs of this explicitness only become visible through extended modelling practice.

The study is conducted through a series of case studies developed in Agda, spanning multiple domains: a railway system modelled at both problem-space and solution-space levels, a structure-aware version control system, file and order management systems, and a typed calculator serving as a low-payoff baseline. Across these models, recurring patterns are identified, including semantic refinement, projection between modelling levels, and the relocation of invariants from predicates into type structure.

Cross-case analysis suggests that dependent types can significantly improve clarity and local reasoning by making ill-formed states unrepresentable, but at the cost of increased proof burden, reduced modelling flexibility, and higher refactoring effort. The thesis concludes by distilling practical design guidance for future modellers, outlining when dependent types are likely to aid domain understanding, and when their use is unwarranted or counterproductive.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Attribution 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://creativecommons.org/licenses/by/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject">dependent types</dim:field>
   <dim:field mdschema="dc" element="subject">domain modelling</dim:field>
   <dim:field mdschema="dc" element="subject">Agda</dim:field>
   <dim:field mdschema="dc" element="subject">formal methods</dim:field>
   <dim:field mdschema="dc" element="subject">type theory</dim:field>
   <dim:field mdschema="dc" element="subject">software modelling</dim:field>
   <dim:field mdschema="dc" element="title">Dependent Types as a Medium for Domain Modelling: Case Studies and Lessons from Agda</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>