From Wikipedia, the free encyclopedia
Jump to: navigation, search
Crystal kthememgr.svg This user is a member of
WikiProject Userboxes.
C-4 This user is an expert C programmer.
C++-3 This user is an advanced C++ programmer.
Java-4 This user is an expert Java programmer.
pas This user can program in Pascal.
λ This user is fluent in Lambda calculus.
Lambda lc.svg This user is an intermediate Scheme programmer.
py This user can program in Python.
Tcl This user is a Tcl scripter.
Perl-1 This user is a beginning Perl programmer.
bash This user can program in Bash.
<html> This user can write HTML.
MAT This user is a MATLAB programmer and user.
it Questo utente è di madrelingua italiana.
en-2 This user can contribute with an intermediate level of English.
Search user languages
a²+b²=c² This user is an intermediate mathematician.
\sqrt{2} This user knows how to prove that the square root of two is irrational.
10 This user realizes that there are 10 types of people in this world: those who understand binary and those who do not.

Who Blaisorblade is[edit]

  • a PhD student in Computer Science at Philipps-Universität Marburg, in Germany. Focus: (functional) programming languages and software development, and efficient programming language implementations.
  • a graduate in Computer Science at University of Catania
  • an ex-Linux kernel hacker, even if not at the top-level (I've worked mainly on User-mode Linux)
  • an open-source sympathizer
  • a Scala programmer, with some experience in Haskell, and past experience in C/C++/Java
  • a fan of Dream Theater and of various epic/power metal bands. I'm no expert on the music side, still I often edit articles about groups I like (being careful to limit my contributions to areas where I've enough knowledge).
  • a film passionate
  • an anime fan

Blaisorblade TODOs[edit]

Personal notebook for my TODOs as Wikipedia editor: - improve pages related to functional programming, as I run into them. Tail call and Tail recursion was the first victim.

- quite outdated items:

What I enjoy doing on Wikipedia[edit]

  • improve pages on what I study as PhD student
  • shed light on the parallels between lambda calculus, recursion theory and denotational semantics.
    • The treatment of recursive functions is done through least fixed point in all of them, but from totally different starting points. And discovering this parallel (which wasn't thought in my courses) was really nice.
    • Also, Rice's theorem has equivalents in both combinatory logic (which is on wikipedia) and lambda calculus (this is not present in wikipedia article, must be added).


Some stuff I will need to find (I'll need to move this in some subpage):

Committed identity: 59ef625e0eb81851ca68ec852314014cd991a2f583e057b86caa373faf7144442558a1de1fcb5948ae19b021280632f098faed943a3b5a2e8668ea86e33c781f is a SHA-512 commitment to this user's real-life identity.