C9 Lectures
61 Entries
 Recent
 Most Viewed
 Top Rated

Language(s)

C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 10 of 13
Avg Rating: 4
(12)In Chapter 10, Declaring Types and Classes, Dr. Meijer teaches us about type declarations, data declarations, arithmetic expressions, etc. In Haskell, a new name for an existing type can be defined using atype declaration:type String = [Char]String is a synonym for the type [Char].Like function… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 9 of 13
Avg Rating: 5
(11)In Chapter 9, Interactive Programs, Dr. Meijer will teach us how to make programs in Haskell that are sideeffecting:interactive. Haskell programs are pure mathematical functions with no side effects. That said, you want to be able to write Haskell programs that can read input from the keyboard and… 
C9 Lectures: Dr. Brian Beckman  Covariance and Contravariance in Physics 1 of 1
Avg Rating: 4
(12)By now, you know Brian Beckman given how many times he's been featured on Channel 9 and, well, just how amazing he is. Brian is an astrophysicist and software architect currently working on a technology we can't talk about...yet... Stay tuned for that. Dr. Beckman is the perfect choice for a new… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 8 of 13
Avg Rating: 4
(11)In Chapter 8, Functional Parsers, it's all about parsing and parsers. A parser is a program that analyses a piece of text to determine its syntactic structure. In a functional language such as Haskell, parsers can naturallybe viewed as functions. type Parser = String > TreeA parser is a… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 7 of 13
Avg Rating: 5
(15)In Chapter 7, Dr. Meijer teaches us about HigherOrder Functions. A function is called higherorder if it takes a function as an argument and returns a function as a result:twice :: (a > a) > a > atwice f x = f (f x)The function twice above is higher order because it takes a function… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 6 of 13
Avg Rating: 5
(15)In Chapter 6, Dr. Meijer guides us through the world of recursive functions. In Haskell, functions can be defined in terms of themselves. Such functions are called recursive. For example: factorial 0 = 1factorial (n+1) = (n+1) * factorial nfactorial maps 0 to 1, and any other positive… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 5 of 13
Avg Rating: 5
(21)In Chapter 5, Dr. Meijer introduces and digs into List Comprehensions. In mathematics, comprehension notation is used to construct new sets from old sets. In Haskell, you can create new lists from old lists using a similarcomprehension syntax:[x^2  x < [1..5]]The above notation represents the… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 4 of 13
Avg Rating: 5
(19)In Chapter 4, Dr. Meijer teaches us about the art and practice of defining functions. Functions can be defined using conditional expressions and in Haskell conditional expressions must always have an else clause. Functions can also be defined using guarded equations and pattern matching. You will… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals, Chapter 3 of 13
Avg Rating: 5
(18)In Chapter 3, Dr. Meijer explores types and classes in Haskell. A type is a collection of related values and in Haskell every wellformed expression has a type. Using type inference, these types are automatically calculated at run time. Ifexpression e returns a type t, then e is of type t, e :: t. A… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals, Chapter 2 of 13
Avg Rating: 4.75
(41)In Chapter 2, Dr. Meijer introduces Haskell syntax and notation (via a Haskell implementation called Hugs, to be precise, which is based on Haskell 98) and we learn about the Haskell syntax that represents the fundamental construct of functional programming:functions. It's not like you're used to in…