Do you want to talk about a recent paper that you are excited about? Do you want to explain fundamental papers of your field to a wider audience? Do you want to (re-)discover important research works in computer science? Do you have this really cool paper you want to tell us about? Present the papers that you love, tell us about how you've implement them and use them, or simply listen and discuss!
We follow the Papers We Love Code of Conduct.
If you want to give a talk please create an issue so we can discuss the details.
Sign-up: Please RSVP for meetings via Meetup
Gergő will be presenting Brown & Palsberg's paper from POPL 2017: "Typed Self-Evaluation via Intensional Type Functions"
We can easily make a typed representation for STLC in Haskell, and then write an evaluator over that representation. But can we write that in STLC? Or can we write it in Haskell, but for Haskell itself?
This paper is in some sense a sequel to last year's "Breaking Through the Normalization Barrier" by the same authors; that one was about self-unquoting of the form
unquote : Exp t -> t
This one is about self-reduction of the form
reduce : Exp t -> Exp t
(with the result encoding a normal form)
In both cases, the question we are interested in is, can we arrange for the host and the target language to coincide?
Our second meetup will on the 13th of July (Thursday). We start at 19:00, and the doors will open at around 18:30-18:45. It will be again hosted by our friends at LogMeIn.
This time Károly Lőrentey will hold a presentation from Chris Okasaki's "Red-black trees in a functional setting" paper.
Everybody learns about balanced binary search trees in their introductory computer science classes, but even the stouthearted tremble at the thought of actually implementing such a beast. The details surrounding rebalancing are usually just too messy. To show that this need not be the case, we present an algorithm for insertion into red-black trees (Guibas & Sedgewick, 1978) that any competent programmer should be able to implement in fifteen minutes or less.
You can find it here:
Okasaki, C. (1999). Red-black trees in a functional setting. Jour…
Update: We'll start a bit later than planned. There will be another event before ours, so come at 19 o'clock at the earliest, and we start around 19:15!
I started it, so it's only fair that I should give the first presentation in this meetup.:)
My talk will be based on Philip Wadler's The essence of functional programming paper.
"This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required.
Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exceptions, state, and continuations; and also provide effects not easily achieved with such features. The types of a program reflect which effects occur.
The first section is an extended example of the use of monads. A simple interpreter is modified …