Media Summary: A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ... Drilling down into the parts of a function specification: preconditions, postconditions, examples. Textbook: ... Developing an implementation of a data abstraction, as an ongoing example of the documentation that implementers need ...

Induction On Lists Ocaml Programming Chapter 6 Video 28 - Detailed Analysis & Overview

A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ... Drilling down into the parts of a function specification: preconditions, postconditions, examples. Textbook: ... Developing an implementation of a data abstraction, as an ongoing example of the documentation that implementers need ... Total correctness = partial correctness + termination. Termination is not decidable in general, but well-founded relations provide a ... Proving the correctness of recursive functions leads to the proof technique of mathematical

Photo Gallery

Induction on Lists | OCaml Programming | Chapter 6 Video 28
Induction on Trees | OCaml Programming | Chapter 6 Video 30
Induction on an ADT for Natural Numbers | OCaml Programming | Chapter 6 Video 27
Example Proof: List Length and Append | OCaml Programming | Chapter 6 Video 29
Equality of Expressions | OCaml Programming | Chapter 6 Video 22
Example Proof: Summation | OCaml Programming | Chapter 6 Video 25
Example Proof: Iterative Factorial | OCaml Programming | Chapter 6 Video 26
Parts of a Function Specification | OCaml Programming | Chapter 6 Video 3
Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5
Example Proof: Preorder and Length | OCaml Programming | Chapter 6 Video 31
List Syntax and Semantics | OCaml Programming | Chapter 3 Video 2
Total Correctness | OCaml Programming | Chapter 6 Video 33
Sponsored
View Detailed Profile
Induction on Lists | OCaml Programming | Chapter 6 Video 28

Induction on Lists | OCaml Programming | Chapter 6 Video 28

Structural

Induction on Trees | OCaml Programming | Chapter 6 Video 30

Induction on Trees | OCaml Programming | Chapter 6 Video 30

Structural

Induction on an ADT for Natural Numbers | OCaml Programming | Chapter 6 Video 27

Induction on an ADT for Natural Numbers | OCaml Programming | Chapter 6 Video 27

Natural numbers can be represented as an

Example Proof: List Length and Append | OCaml Programming | Chapter 6 Video 29

Example Proof: List Length and Append | OCaml Programming | Chapter 6 Video 29

A proof by structural

Equality of Expressions | OCaml Programming | Chapter 6 Video 22

Equality of Expressions | OCaml Programming | Chapter 6 Video 22

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

Sponsored
Example Proof: Summation | OCaml Programming | Chapter 6 Video 25

Example Proof: Summation | OCaml Programming | Chapter 6 Video 25

Proof by

Example Proof: Iterative Factorial | OCaml Programming | Chapter 6 Video 26

Example Proof: Iterative Factorial | OCaml Programming | Chapter 6 Video 26

Proof by

Parts of a Function Specification | OCaml Programming | Chapter 6 Video 3

Parts of a Function Specification | OCaml Programming | Chapter 6 Video 3

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

Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5

Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5

Developing an implementation of a data abstraction, as an ongoing example of the documentation that implementers need ...

Example Proof: Preorder and Length | OCaml Programming | Chapter 6 Video 31

Example Proof: Preorder and Length | OCaml Programming | Chapter 6 Video 31

A proof by structural

List Syntax and Semantics | OCaml Programming | Chapter 3 Video 2

List Syntax and Semantics | OCaml Programming | Chapter 3 Video 2

The formal syntax and semantics of

Total Correctness | OCaml Programming | Chapter 6 Video 33

Total Correctness | OCaml Programming | Chapter 6 Video 33

Total correctness = partial correctness + termination. Termination is not decidable in general, but well-founded relations provide a ...

Inductive Proofs about Recursive Functions | OCaml Programming | Chapter 6 Video 24

Inductive Proofs about Recursive Functions | OCaml Programming | Chapter 6 Video 24

Proving the correctness of recursive functions leads to the proof technique of mathematical