Category

My Notes

notes about functional programming and research in computing science

A little bit of recursion – the map function

One of the most useful things that you encounter all the time in programming is applying the same principle on every number in a sequence. For example, sometimes we have a list of numbers: [1,2,3] and we want to construct… Continue Reading →

Share Button

Towards general techniques in programming – the second diagonal principle

When we work with infinite lists in Haskell, one important problem is: Problem. Construct a list which generates all the distinct ordered pairs of natural numbers. So, we want a method to generate the set: {(0,0), (0,1),(0,2),…, (1,0), (1,1),(1,2),…} etc…. Continue Reading →

Share Button

© 2018 — Powered by WordPress

Theme by Anders NorenUp ↑