Haskell
24 Entries
 This Week
 This Month
 All Time

Language(s)

C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals, Chapter 1 of 13
Avg Rating: 4.75
(77)Welcome to a new technical series on Channel 9 folded into a different kind of 9 format: C9 Lectures. These are what you think they are, lectures. They are not conversational in nature (like most of what you're used to on 9), but rather these pieces are entirely focused on education, coming to you… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals, Chapter 2 of 13
Avg Rating: 4.75
(50)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… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals, Chapter 3 of 13
Avg Rating: 5
(19)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 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 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 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 13 of 13
Avg Rating: 5
(13)Well, my friends, the day has arrived. For thirteen weeks, you have been provided all the conceptual tools to take the leap into the deep end of the functional programming pool and float safely. The great Dr. Erik Meijer has generously given his value time to teach us the fundamentals as delivered… 
C9 Lectures: Dr. Erik Meijer  Functional Programming Fundamentals Chapter 12 of 13
Avg Rating: 5
(13)In Chapter 12, Lazy Evaluation, Dr. Meijer takes us on a journey into the world of order of evaluation (when expressions are evaluated). In the case of lazy evaluation, computation is delayed until the result of the computation is known to be required. Most programming languages that most of you use… 
Simon PeytonJones and John Hughes  It's Raining Haskell
Avg Rating: 5
(10)Ever wonder what would happen if you happened upon Simon PeytonJones, author of the Glasgow Haskell Compiler (GHC) and a key contributor to the Haskell functional programming language, and John Hughes, fellow Haskellite, computer scientist, creator of QuickCheck, and author of the landmark paper,…