Functional on The VikiD Truth

Haskell Kata

Thu, 06 Apr 2023 04:16:37 +0400

Haskell Kata

Getting Started

min 1 2 max 1 2 }

dbl x = x + x
dbls x y = dbl x + dbl y

dsn x = if x > 100
 then x
 else x*2
dsn' x = (if x > 100 then x else x*3) + 1

nL = [0,1,2,3,4,5,6,7,8,9]
nL ++ [10,11,12]
0:nL
nL!!3
nLL= [nL,nL,nL]
nLL ++ [[0,2]]
[10,11,12]:nLL

length nL
null nL
take 5 nL
drop 5 nL
head [ ]
head nL
tail nL
last nL
init nL
reverse nL
maximum nL
minimum nL
sum nL
product nL
5 `elem` nL
elem 5 nL

[1..10]
['a'..'l']
[3, 4..12]
take 5 [40, 45..]
take 20 (cycle nL)
take 10 (repeat 5)
replicate 4 10

[ dsn x | x <- nL, x > 5 ]
beepBop xs = [ if x < 5 then "beep" else "bop" | x <- xs, odd x]
[ x*y | x <- [2,5,10], y <- [8,10,11]]

Purescript

Sat, 27 Aug 2022 00:18:37 +0400

Purescript

Here is the truth about PureScript: it’s Haskell’s ideas, aimed at the places JavaScript runs. You get strong static types, purity and type classes, and out comes small, readable JavaScript.

Haskell

Sun, 31 Jul 2022 04:52:11 +0400

Haskell

Here is the truth about Haskell: it is the language where the type checker is not a nag – it is a collaborator that writes half the program with you. Once you accept that purity and laziness are features, a lot of software architecture lessons fall out for free.

Lambda Calculus

Sat, 28 Aug 2021 03:24:22 +0400

Lambda Calculus

Here is a truth that still amazes me: you can build all of computation out of nothing but functions. No numbers, no booleans, no loops, no variables that change – just making functions and applying them. That tiny system is the lambda calculus, and every Lisp, every closure, every => in JavaScript descends from it.

Functional Programming

Sat, 28 Aug 2021 03:19:02 +0400

Functional Programming

Here is the truth functional programming keeps repeating until it sinks in: if you stop changing things, most of your bugs disappear. You write functions that take values and return new values, and you build programs by composing them.