Overview

This course is about mechanical proof assistants, how they work, and what they can be used for. It presents specification and proof techniques used in industrial grade theorem provers, teaches the theoretical background to the techniques involved, and shows how to use a theorem prover to conduct formal proofs in … For more content click the Read More button below. Topics covered included: higher order logic, natural deduction, lambda calculus, term rewriting, data types and recursive functions, induction principles, calculational reasoning, mathematical proofs, decision procedures for a variety of logical domains, and proofs about programs. Note: experience with (first-order) logic and functional programming is required.

Conditions for Enrolment

Prerequisite: Completion of 48 UOC

Course Outline

To access course outline please visit below link (Please note that access to UNSW Canberra course outlines requires VPN):

Fees

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)