User:Blaisorblade
From Wikipedia, the free encyclopedia
Programming
λ This user is fluent in Lambda calculus .
This user can program in Python .
| Wikipedia:Babel |
|---|
it Quest'utente è di madrelingua italiana . |
| Search user languages |
Other
a2+b2=c2 This user is an intermediate mathematician .
{\displaystyle {\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 ]- Paolo G. Giarrusso, a PhD student in Computer Science, in Germany. Focus: (functional) programming languages and software development, and efficient programming language implementations.
- PhD started at Philipps-Universität Marburg and continued at Tübingen University.
- 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:
- delete/merge Programming Complexity (it could be an introduction for Software metric, or could be just a part of Software crisis, which needs fixing too).
- fixup Criticism of C++
- join WikiProject C++, WikiProject Computer science (see WikiProject Computer science/Assessment) and WikiProject Computing (see Template:WikiProject Computing)
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).
Reminders
[edit ]Some stuff I will need to find (I'll need to move this in some subpage):
- Wikipedia:Layout#Standard appendices and descriptions
- Done ({{done}} - Template:Done) (I've seen the usage of , but the template is better, or at least {{tick|15}}:[画像:check]Y), for talk pages
Committedidentity : 59ef625e0eb81851ca68ec852314014cd991a2f583e057b86caa373faf7144442558a1de1fcb5948ae19b021280632f098faed943a3b5a2e8668ea86e33c781f is an SHA-512 commitment to this user's real-life identity.