Example Proof Preorder And Length Ocaml Programming Chapter 6 Video 31

A

Structural induction can be used to prove the correctness of functions on lists Textbook: https://cs3110.github.io/textbook.

Drilling down into the parts of a function specification: preconditions, postconditions,

Developing an implementation of a data abstraction, as an ongoing

Natural numbers can be represented as an

Abstraction functions are...abstract. So how could you implement them? Conversion to strings is an

Proof

Structural induction can be used to prove the correctness of functions on trees Textbook: https://cs3110.github.io/textbook.

A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ...

Defining a persistent stack data structure as an

Representation invariants can be implemented and used to

Developing a second implementation of a data abstraction, as an ongoing

A template for function specifications Textbook: https://cs3110.github.io/textbook.

A

Equational reasoning provides a basic

How to implement a function that counts up with every invocation, using references Textbook: https://cs3110.github.io/textbook.

The abstraction function is the key piece of documentation an implementer needs to write; it relates the implementer's view of the ...