Blog articles

0
comment
on 9/1/2012 9:54 PM
.
0
comment
on 9/1/2012 3:09 AM
I'm very pleased to announce an exciting new workshop being added to the POPL program at POPL 2013.  This workshop is aimed at anyone who loves the application of functional programming (and indeed other programming paradigms as well) to data-rich domains[...]
.
0
comment
on 8/31/2012 12:46 PM
Some say that API design is one of the hardest things in programming. A few even go as far as to say you should have at least 10 years of experience to even attempt it. While I think this process can be sped up almost an order of magnitude by good mentors[...]
.
0
comment
on 8/30/2012 10:07 AM
In the last article I defined the Succ operation on numbers and showed how this can be used to implement addition in untyped lambda calculus. Because of the number representation I choose this was rather easy so Subtraction should be … Continue reading →
.
0
comment
on 8/30/2012 12:24 AM
This is a meta post to coincide with posting over 100 articles over 4 years, going back over some the more popular along with some of my own personal favourites. I started blogging regularly back in 2007 on the Applied Games Group blog, here’s a selection[...]
.
0
comment
on 8/28/2012 9:23 AM
You might have heard that functional programming is based on Lambda Calculus – and indeed this is true (LISP was greatly influenced by Alonzo Church’s Lambda Calculus and you might have heard of “lambda”s in other functional languages as well) … Continue [...]
.
0
comment
on 8/28/2012 5:16 AM
I just installed DISQUS on this blog – I hope this will help me hold the spam down and you to a better user experience. As always feel free to give me your thoughts…
.
0
comment
on 8/27/2012 8:12 PM
Constraint Programming is a vast subject area in AI and Operations Research. Some well-known Constraint Satisfaction Problems (CSP) are Sudoku, N-Queens, Map Coloring, Scheduling (of many kinds, e.g. classrooms-to-courses). In general, CSP are NP-hard but[...]
.
0
comment
on 8/27/2012 8:12 PM
Constraint Programming is a vast subject area in AI and Operations Research. Some well-known Constraint Satisfaction Problems (CSP) are Sudoku, N-Queens, Map Coloring, Scheduling (of many kinds, e.g. classrooms-to-courses). In general, CSP are NP-hard but[...]
.
0
comment
on 8/27/2012 12:18 PM
Hello! Just a quick note to mention that I will be speaking about Aspect Oriented Programming at next Saturday’s DDD10 in Reading, some great sessions in the line up this year, hope to see you there
.
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy
Built with WebSharper