HASKELL

101

Functional Programming ?


Useless ?









Why Haskell ?










What's Haskell ?







Pure Functional Programming 
Language





Lazily Evaluated
Language




Statically Typed
Language

  • Type Inference
  • Hindley - Milner Type System





Elegant 
and 
Concise




Kick Ass 
Language
(Academia)

  • No Null Pointers
  • No Loops
  • No MutableVariables


And 


Pattern Matching 


Haskell Compilers



Hugs


GHC


Simon Peyton Jones



  • Major Contributor to Design of Haskell.
  • Wrote GHC Compiler.





Lets Try it Out






Basic Constructs
and 
Operations







FUNCTIONS







LISTS







TUPLES






RANGES



List Comprehensions


set notation

Lets Implement

Quick Sort in Haskell

  • Sorting Algorithm
  • Developed by Tony Hoare
  • Average O(nlogn)
  • Worst O(n2)
Problem #2

Duplicate the elements of a list.


[1 , 2, 3 ]

=>

[1, 1, 2, 2, 3, 3]
Problem #3

Convert String into Uppercase


INPUT: "abcd"

OUPUT: "ABCD"


Learn You a Haskell




More awesomeness

 to be followed ...


Thank You


Q & A

Introduction to Haskell

By Rajeev Bharshetty

Made with Slides.com

Introduction to Haskell

  • 2,918

More from Rajeev Bharshetty