Logic Foundations With Haskell Haskell 1 Setup

I explain how to

I discuss how to define functions using pattern matching and guards. Then I introduce where, let and case expressions. All code ...

In this video we implement sets and associated functions. All code can be found in the course git repository ...

In this video we implement our own version of the type Bool, along with the functions in the standard library that act on Bool.

We start learning basic

We implement functions as sets of pairs. All code can be found in the course git repository ...

In this course we will cover

We cover the basic definitions for relations and implement them in code. All code can be found in the course git repository ...

We implement the typeclasses Ord, Enum, Num, Real and Integral for the natural numbers. This allows us to use all standard ...

We cover the basic definitions of set theory in preparation for understanding the ZFC axioms. 00:00 Introduction 00:17 Definition: ...

We implements datatypes for integers based in the natural numbers. Correction: At 04:50 I forgot the case (==) (Neg Z) (Pos Z) ...

We discuss how the foldr and foldl patterns can be used for very compact implementations. All code can be found in the course git ...

We implement natural numbers, arithmetic and comparison using an inductive datatype. All code can be found in the course git ...

We look at three modules that include Rational and Complex numbers as well as Polynomials. We use these to implement ...

I show how the Maybe datatype and lists can be used to deal with functions that return either zero or multiple values. All code can ...

We cover types, type variables, and typeclasses in

We cover the semantic definitions for propositional

We formally define the syntax of propositional