<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://adelfa-prover.org/about</loc>
</url>
<url>
<loc>https://adelfa-prover.org/download</loc>
</url>
<url>
<loc>https://adelfa-prover.org/</loc>
</url>
<url>
<loc>https://adelfa-prover.org/publications</loc>
</url>
<url>
<loc>https://adelfa-prover.org/reference-guide</loc>
</url>
<url>
<loc>https://adelfa-prover.org/walkthrough</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/first-order/even-or-odd</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/first-order/ident</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/first-order/leq</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/first-order/lists</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/first-order/map</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/lambda-calculus/orbi</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/lambda-calculus/subj-reduction</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/lambda-calculus/unique</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/logic/cut</loc>
</url>
<url>
<loc>https://adelfa-prover.org/examples/programming-languages/poplmark</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/beluga</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/introduction</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/orbi</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/poplmark</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/size</loc>
</url>
<url>
<loc>https://adelfa-prover.org/theory/schema-subsumption/subst-size</loc>
</url>
</urlset>
