/CalcCheck

Abridged lecture notes for CompSci/SfwrEng 2DM3 2020 and documentation on CalcCheck

<title>Calculational Mathematics and CalcCheck</title> <style type="text/css"> // @license-end </script>

Calculational Mathematics and CalcCheck

Live webpage: https://alhassy.github.io/CalcCheck/

proof trees vs calculational proofs.png

Videos

  1. Introduction to Discrete & Calculational Maths Sep 8

    What is a calculational proof? What is discrete mathematics? How is math related to programming: “proofs-as-programs”.

  2. Grammatical Analysis and Boolean Operators Sep 10

    A proof is a “story”, and calculation hints are the “transitions” that make the story flow nicely. The formulae are the “sentences” and they are formed from operators, constants, and variables which act as “verbs”, “names”, and “pronouns”, respectively.

    ℕumber arithmetic is learned by memorising parts of infinitely large addition and multiplication tables. In contrast, 𝔹oolean arithmetic has tiny 2×2 “truth tables”. As such, 𝔹 may be easier to learn than ℕ.

  3. Ladies and Tigers, a teaser Sep 11

    Continuing the discussion on Boolean operators and how they can be used to model puzzles.

  4. Substitution Sep 15

    Textual substitution is a way to implement function application, grafting on trees, and can be used for assignment commands in programming.

  5. Inference rules, Proofs-are-programs, and Equivalence Part I Sep 17

    Update: There will be no knights and knaves problems in the upcoming Sep 22 midterm; but possibly in a future midterm.

    The inference rules act as the foundational justification for the equational proof style; the online lecture notes go into more detail.

  6. Inference rules, Proofs-are-programs, and Equivalence Part II (with lofi music) Sep 18

    Quickly show how a program can be shown to meet its specification, discuss equivalence and negation for the purposes of solving knights and knaves problems.

    Sep 22 is the first midterm; it is online during class time.

  7. Tabulation vs Calculation Sep 24

    We review basic operations on the Booleans with a focus on how manipulating symbols can be more effective than constructing truth tables, or evaluating expressions by “plug and chug” simplifications.

    We also discuss formalisations of English phrases as propositional expressions.

… more content at the webpage https://alhassy.github.io/CalcCheck/

Github Repository

Author: Musa Al-hassy

Created: 2020-09-25 Fri 07:46

Validate