To apply you must hold a recent PhD (or be about to graduate) related to either functional or constraint programming. Experience in both areas is an advantage.
You will work closely with prof. Schrijvers and his PhD students at KU Leuven, as well as with the GRACeFUL project partners across Europe.
The position is for 3 years. The salary is competitive and the starting date negotiable (but no later than February 1). Moreover, KU Leuven's policy of equal opportunities and diversity applies to this position.
Application procedure: http://people.cs.kuleuven.be/~tom.schrijvers/postdocposition2.html
(excluding import lines):import Pipes import Pipes.Network.TCP import qualified Pipes.ByteString as PBS import Control.Concurrent main = withSocketsDo $ connect "irc.freenode.net" "6667" $ \(s, _) -> forkIO (runEffect $ PBS.stdin >-> toSocket s) >> runEffect (fromSocket s 4096 >-> PBS.stdout) submitted by kvanberendonck
[link] [62 comments]
In trying to read up on dependent types, i've often read that they give us much more power than we would otherwise have. However, usually the only example provided is a vector whose length is part of its type. This is certainly useful, but surely not the only possible example of the power and utility of DTs.
What are some other day-to-day issues in programming, or mathematics, addressed by dependent types?
 And, i feel, certainly more illustrative than the (imo) ridiculous overuse of the fib function as an example of what programming in a given language is like.submitted by flexibeast
[link] [27 comments]
For all you local folks, I'll be giving a talk about my dissertation on November 5th at 4:00–5:00 in Ballantine Hall 011. For those who've heard me give talks about it before, not much has changed since NLCS 2013. But the majority of current CL/NLP, PL, and logic folks haven't seen the talk, so do feel free to stop by.
Abstract: Many natural languages allow scrambling of constituents, or so-called "free word order". However, most syntactic formalisms are designed for English first and foremost. They assume that word order is rigidly fixed, and consequently these formalisms cannot handle languages like Latin, German, Russian, or Japanese. In this talk I introduce a new calculus —the chiastic lambda-calculus— which allows us to capture both the freedoms and the restrictions of constituent scrambling in Japanese. In addition to capturing these syntactic facts about free word order, the chiastic lambda-calculus also captures semantic issues that arise in Japanese verbal morphology. Moreover, chiastic lambda-calculus can be used to capture numerous non-linguistic phenomena, such as: justifying notational shorthands in category theory, providing a strong type theory for programming languages with keyword-arguments, and exploring metatheoretical issues around the duality between procedures and values.
I recently picked up haskell and started learning it using learnyouahaskell.com I am really enjoying it so far. But tutorials don't challenge me to come up with solutions or really think about problems in this weird language. and so I want to make something using haskell, just a smallish hobby project. But I can't come up with anything interesting that I want to make. And so I was looking for suggestions.
I want something that is challenging, but not something impossible for someone fairly new to haskell. It doesn't have to be original or anything, I just want something interesting.
thanks!submitted by Minkzilla
[link] [12 comments]