<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL832</id>
	<title>COL832 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL832"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL832&amp;action=history"/>
	<updated>2026-04-09T07:50:04Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://wiki.devclub.in/index.php?title=COL832&amp;diff=625&amp;oldid=prev</id>
		<title>Prashantt492: Creating course page via bot</title>
		<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL832&amp;diff=625&amp;oldid=prev"/>
		<updated>2026-03-04T10:00:39Z</updated>

		<summary type="html">&lt;p&gt;Creating course page via bot&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Infobox Course&lt;br /&gt;
| code = COL832&lt;br /&gt;
| name = proofs and Types&lt;br /&gt;
| credits = 3&lt;br /&gt;
| credit_structure = 3-0-0&lt;br /&gt;
| pre_requisites = COL226, COL352&lt;br /&gt;
| overlaps = &lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== COL832 : proofs and Types ==&lt;br /&gt;
Syntax and semantic foundations: Ranked algebras, homomorphisms, initial algebras, congruences. First-order logic review: Soundness, completeness, compactness. Herbrand models and Herbrand&amp;#039;s theorem, Horn-clauses and resolution. Natural deduction and the Sequent calculus. Normalization and cut elimination. Lambda-calculus and Combinatory Logic: syntax and operational semantics (beta-eta equivalence), confluence and Church-Rosser property. Introduction to Type theory: The simply-typed lambda-calculus, Intuitionistic type theory. Curry-Howard correspondence. Polymorphism, algorithms for polymorphic type inference, Girard and Reynolds&amp;#039; System F. Applications: type-systems for programming languages; modules and functors; theorem proving, executable specifications.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>