Odessa is a really sweet city. One thing I noticed is that while some of the buildings seem to be in a deplorable condition from the outside, they actually turn out to be very nice once you’re indoors! This was for example the case for the hostel I was staying in. The contrast is also seen elsewhere in the city, with brand new appartements next to ramshackle, desolated houses.
This is, however, not the case for the very centre of the city – around the famous Potemkin Stairs. This neighbourhood is absolutely amazing.Hakyll at OdHac
At the Hackathon, I did a small presentation about Hakyll on friday, and some awesome people decided to help me improve Hakyll a bit this weekend. We were able to implement some exciting features.If-else conditionals in templates
We added some functionality to the Hakyll templates which you allows you to check if a certain value is defined. We chose to use the same syntax as Pandoc, to further ease integration:<h1>$title$</h1> $if(author)$ <em>by $author$</em> $endif$
We also support if-else-endif. On the plane back, I also took the time to implement $foreach$ and $partial$.Teasers
Teasers allow you to write a short introduction for a blogpost, and make it easy to reproduce this introduction on another page together with a “Read more” link. We decided to implement the convention used in Wordpress, which means you define your teasers using the following simple format:--- title: Some post --- This is the introduction. <!--more--> The rest of the post... Pagination
We also started to work on a generic Pagination module. It’s not finished yet but it should be possible to clean this up and package it by the end of the week. I’m quite excited about this feature because lots of people have requested it in the past.
Additionally, we did some performance improvements and fixed a bug or two. All in all, a very productive and fun Hackathon! I hope to package up all these changes and push them to Hackage soon.
Thanks for contributing to Hakyll, Alexey Smirnov, Anton Dubovik, Dmitriy Shamatrin, Ivan Veselov and Pavel Poukh! And, of course, thanks for organizing, Roman!
Some time ago a friend asked for a good introductory work on Category theory. I never did answer his question to my satisfaction, as the stuff I picked up on the subject was here and there as I needed it, and I thought there was never any succinct introductory work.
Well, I thought wrongly.
Above link ... links to the seminal summa, available for you if you wish to pursue this delightful area of research into expressivity in mathematics.
Also, of course, there's the working-quantum-physicist's introduction at:
Having a working knowledge of quantum computation is not necessary, probably not even helpful, but a very nice introduction is Quantum Computation and Quantum Information by Nielsen and Chuang, if you wish to see the source from where I got to categories and Category Theory.
Dr. Baez's work starts off lightly and playfully, but then gets pretty deep pretty quickly, as he goes into the Groupoid/Topoid theoretical application of Category Theory, but that's to be understood, as quantists are always concerned about (super-)symmetries, and I, not so much, as I look for the more practical application of Categories in Monoids and the Relational Calculus, but there it is.
I do, of course, have more advanced works on this topic if you wish to research further, and there's always this blog, where I look at the logical implications of cat theory (heh: 'logical' 'implications' ... Math humor). There is, e.g., an introductory article on monads and their computational application at:
I've been using Python for over 3 years now and PHP for about 2-3 before that. I touched on Haskell at uni and then tried again a few months ago. This time I'm really taking a proper stab at it and trying out Euler problems.
I'm up to number 7 and starting to get the hang of making programs but I've found a problem. My programs are slow. Dead slow.
Problem 3 involves finding the 10,001st prime number. My Python implementation takes 7 seconds and my Haskell implementation takes 42.
I was under the impression that Haskell would generally be faster than Python for number crunching, even if not we're talking a big factor of difference. This suggests very strongly to me I'm trying to solve the problem the wrong way with Haskell (I had the same issue moving from PHP to Python). Could you take a look at the two sets of code below and let me know how I could have better designed the program?Teifion
[link] [37 comments]
Have you taught a course using Hutton's textbook on Programming in Haskell? If so, please read on!
As part of the national assessment of universities in the UK that takes place every 5-6 years, I'm producing a case study on the impact of the book on student and professional training. The case study will include a number of quotes from academic and industrial users who have used the book for teaching purposes.
If you have taught a course using the book any time from January 2008 onwards, and would be willing to provide a short quote (2-3 sentences) for the case study, that would be very much appreciated. It doesn't matter if you are no longer teaching the course or are not currently using the book. If you are interested, drop me an email and I'll explain what's involved.
Graham Hutton email@example.com by grahamhutton
[link] [2 comments]
- zipPartions was added to the Scala & Java APIs. zipPartions joins an up to 4 RDDs using a user supplied function. It requires that all of the RDDs have the same number of partitions with no such requirement on size within each partition. https://github.com/mesos/spark/commit/c9c4954d994c5ba824e71c1c5cd8d5de531caf78 https://github.com/mesos/spark/commit/c9c4954d994c5ba824e71c1c5cd8d5de531caf78
- unPersist() was added to the Scala & Java APIs allow the removal of an RDD from persistence once it is no longer needed. https://github.com/mesos/spark/commit/93091f6936262a4006d875bf69b3f8c31c291617
- Bugfix was added to validate that local directories can be created when being added. https://github.com/mesos/spark/commit/c9c4954d994c5ba824e71c1c5cd8d5de531caf78
- Spark’s block UI manager had a bug with Spark Streaming blocks which was fixed https://spark-project.atlassian.net/browse/SPARK-740 https://github.com/mesos/spark/commit/538ee755b41585c638935a93ec838b635149f659
- The shuffle writer now looks at spark.shuffle.file.buffer.kb to determine the buffer to use. Previously the default buffer was 8kb which could cause a lot of unnecessary disk seeks, and the new default is 100kb. https://github.com/mesos/spark/commit/1055785a836ab2361239f0937a1a22fee953e029
I'm presently a Vim zealot and am interested. The idea of being able to config my editor the same way I do XMonad sounds really effing awesome.
This post is me just trying to gauge the current interest and/or size of the community, since it's unclear.submitted by the_lemma
[link] [24 comments]
This summer, spend some quality time with your favorite technology in our 2013 summer programming contest!
The Lisp community is awarding prizes for demonstrating interesting and useful programs, technologies and art using any LISP-based technology.
Lisp, prizes, what's not to like?