This Theory Lunch, I gave an introduction to the functional logic programming language Curry. You can find a write-up of my talk on my personal blog.
A taste of Curry
Reply
MIU in Haskell, part 2
Today, I presented a Haskell program that computes derivations in the MIU formal system from Douglas Hofstadter’s MU puzzle. I have posted a write-up of my talk on my personal blog.
Some reasons to teach lattice theory to undergraduates
First-year students in mathematics and computer science are often troubled with the Schröder-Bernstein theorem, which proves that the natural ordering between cardinal numbers is in fact a partial order, but has a lengthy and convoluted proof. A more accurate study of order structures (often neglected by basic course) would, however, allow to see this fact as an almost immediate consequence of a much simpler, and very powerful, theorem due to Bronislaw Knaster and Alfred Tarski. Continue reading
Finite trees as initial algebra
In the last Theory Lunch session I talked about a category theoretic approach to finite trees. Continue reading
The Constraint kind
I talked about the Constraint kind, a recent addition to Haskell. There is a write-up of my talk on my personal blog.
Some interesting features of Haskell’s type system
I talked about some of Haskell’s type system features. You can find a write-up of my talk on my personal blog.
A stupidly easy way to hack into computers
Do you have a SSH server running somewhere? Have you ever wondered why it gets hammered by brute-force password guess attacks all the time? My server got 4669 login attempts on 2013-01-12. Have you ever wondered what these guys do if they actually manage to get into your server? Have you ever wondered which passwords actually get tried, in order not to use them yourself?
