2014-06-27 — Article of 700 words Programming Haskell Hakyll Foundation Photography
This is the second post about the photography portfolio website project. If you want to find out more about the project, you could read the first post. In this post I will explain the initial setup of the project, and the creation of a bare home page for the site.
Read more...2014-01-30 — Article of 800 words Programming Haskell Hakyll Foundation Photography
I’m starting a new project to create a photography portfolio web site and I want to document its progress in a series of posts. I’ll write them for personal reference, but I will be glad if they will be useful for someone else.
This first post is about the rationale for the project and the initial plan.
Read more...2012-05-18 — Article of 700 words Programming Haskell
I had a little repetitive task to automate in my
mt-euler project:
creating a pdf from a series of Literate Haskell files
using lhs2TeX and xelatex.
Looking for something like make or rake, but written in Haskell, I found Shake.
I used it and I was well pleased with the result.
Read more...2012-04-20 — Article of 700 words Programming Haskell Project Euler
Link to Project Euler problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is $9009=91\times99$.
Find the largest palindrome made from the product of two 3-digit numbers.
WARNING Solution ahead. Don’t read more if you want to enjoy the benefits of Project Euler and you haven’t already solved the problem.
Read more...2012-04-12 — Article of 800 words Programming Haskell Project Euler
Link to Project Euler problem 3
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143?
WARNING Solution ahead. Don’t read more if you want to enjoy the benefits of Project Euler and you haven’t already solved the problem.
Read more...2012-04-10 — Article of 200 words Programming Haskell Project Euler
Link to Project Euler problem 2
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1,2,3,5,8,13,21,34,55,89, …
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
WARNING Solution ahead. Don’t read more if you want to enjoy the benefits of Project Euler and you haven’t already solved the problem.
Read more...2012-04-08 — Article of 300 words Programming Haskell Project Euler
Link to Project Euler problem 1
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
WARNING Solution ahead. Don’t read more if you want to enjoy the benefits of Project Euler and you haven’t already solved the problem.
Read more...HaskDeep is a command line tool, written in Haskell, that computes file hashes traversing recursively through a directory structure. Known hashes are saved to file and they can be used to verify the original files or a copy of them.
Read more...Exercises to learn Haskell programming language.
Read more...Solution to Project Euler problems with Literate Haskell.
Read more...