Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
pp:2023:haskell:l07 [2023/04/22 19:01] tpruteanu [Lists] |
pp:2023:haskell:l07 [2023/04/27 01:17] (current) mihai.udubasa [Lambda calculus as a programming language (optional)] fix typo |
||
|---|---|---|---|
| Line 86: | Line 86: | ||
| The [[https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis | Church-Turing thesis]] asserts that any //computable// function can be computed using lambda calculus (or Turing Machines or equivalent models). \\ | The [[https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis | Church-Turing thesis]] asserts that any //computable// function can be computed using lambda calculus (or Turing Machines or equivalent models). \\ | ||
| - | For the curios, a series of additional exercises covering this topic can be found here: [[pp:2023:haskell:l07-extra|Lambda Calculus as a programming language]]. \\ | + | For the curious, a series of additional exercises covering this topic can be found here: [[pp:2023:haskell:l07-extra|Lambda Calculus as a programming language]]. \\ |
| ===== 7.2 Intro to Haskell ===== | ===== 7.2 Intro to Haskell ===== | ||
| Line 122: | Line 122: | ||
| } | } | ||
| </code>|<code haskell> | </code>|<code haskell> | ||
| - | f l = case l of { | + | f l = case l of |
| [] -> ... | [] -> ... | ||
| (x:xs) -> ... | (x:xs) -> ... | ||
| - | } | ||
| </code> | <code haskell> | </code> | <code haskell> | ||
| f [] = ... | f [] = ... | ||