jerome moliere’s Post

#Notes #Haskell  Under the hood lists in Haskell are implemented as LinkedList. (𝘛𝘳𝘶𝘦 𝘧𝘰𝘳 𝘭𝘪𝘴𝘵𝘴 𝘪𝘯 𝘚𝘤𝘢𝘭𝘢 𝘵𝘰𝘰) 𝗪𝗵𝘆? A natural fit for recursion and pattern matching. Each node can easily be decomposed into the head element and tail which is another list.  𝗖𝗼𝗱𝗲: A function that returns the second last element in a list 𝘭𝘢𝘴𝘵𝘉𝘶𝘵𝘖𝘯𝘦 :: [𝘢] -> 𝘔𝘢𝘺𝘣𝘦 𝘢 𝘭𝘢𝘴𝘵𝘉𝘶𝘵𝘖𝘯𝘦 𝘹𝘴 = 𝘤𝘢𝘴𝘦 𝘹𝘴 𝘰𝘧  [] -> 𝘕𝘰𝘵𝘩𝘪𝘯𝘨  [ _] -> 𝘕𝘰𝘵𝘩𝘪𝘯𝘨  [𝘹,_] -> 𝘑𝘶𝘴𝘵 𝘹  (_:𝘹𝘴) -> 𝘭𝘢𝘴𝘵𝘉𝘶𝘵𝘖𝘯𝘦 𝘹𝘴 #Recursion #FunctionalProgramming 𝘰𝘳 𝘵𝘩𝘦𝘳𝘦 𝘢𝘯𝘥 𝘣𝘢𝘤𝘬 𝘢𝘨𝘢𝘪𝘯 😃 #RealWorldHaskell

🔄 Explore 'A Lazy Scheme in Haskell' with André M van Meulebrouck at LambdaConf. Discover the insights and lessons from implementing a lazily evaluated subset of Scheme in Haskell. Perfect for enthusiasts of both languages! Register here ➡️ https://buff.ly/3wbaG7U #Scheme #Haskell

A couple of weekends ago, I wrote a terminal-based Wordle clone in Haskell. No real reason to, other than I like revisiting Haskell every few years after I learn more about software engineering and computing in general. Check it out! https://lnkd.in/eyUrcBuK (I really should write a blog post about this; after all, if you make a project but haven't blogged about it, what have you actually done?)

My new blog post about the specialization optimization in the Glasgow Haskell Compiler (GHC) is now published on the Well-Typed blog! In the post, I describe the recent work we have done to improve the observability of specialization by adding new profiling methods to GHC and developing a GHC plugin. Go check it out: https://lnkd.in/gtFXbKiG

My first function using Haskell 💃🏻💃🏻, A few things: - No parentheses of commas to separate arguments in a function. - No return keyword. Functions are expressions. - A special tuple with zero elements, (). #FunctionalProgramming #LazyEvaluation #Haskell

Question to this audience: Should compilers and static analyzers be written in Rust nowadays? Or should it be OCaml or Haskell?

In this blog post I attempt to provide a guide on Unicode and Haskell strings and how to choose between the various different types. https://lnkd.in/gC96v9fQ

a little haskell code for epic hillarity ghci> nouns = ["hobo","frog","pope"]   ghci> adjectives = ["lazy","grouchy","scheming"]   ghci> [adjective ++ " " ++ noun | adjective <- adjectives, noun <- nouns]   ["lazy hobo","lazy frog","lazy pope","grouchy hobo","grouchy frog",   "grouchy pope","scheming hobo","scheming frog","scheming pope"]  *this is from an online haskell learning book...

Anyone have a recommendation for a language that: 1. compiles to native code 2. functional with pattern matching (like to the Haskell degree) 3. But just a little less as crazy as Haskell (don't feel like monad-gonad business) I'm having withdrawal symptons from Haskell.