« May 2005 | Main | September 2005 »
June 28, 2005
Cayenne and Agda
I did not know that Agda was regarded as the proper successor to Cayenne! Now I really have to get serious about getting into Agda.
But it appears that this may not be the case - see further discussion on LtU.
Posted by Carette at 11:06 AM | Comments (0)
June 25, 2005
Haskell's overlooked object system
Oleg Kiselyov and Ralf Laemmel have written a most enjoyable paper showing not only that one can do OO in Haskell (via a reasonable encoding), but get for free a number of advanced features not available in most mainstream OO languages. Well worth reading (even though I suspect some short-sighted reviewers of a previous version of this paper disagreed).
Posted by Carette at 05:46 PM | Comments (0)
June 23, 2005
How to read a paper
Via LtU again, a link to a nice summary on how to read a paper.
Posted by Carette at 10:12 AM | Comments (0)
June 21, 2005
Stuff to check out
A bit of miscellany. It is definitely worthwhile to keep abreast of what Simonyi's Intentional Software company is doing. One of the blog entries points to Martin Fowler's recent essay on language workbenches. One of the items pointed out is JetBrains' work on Meta Programming Systems.
In a different vein, a post on LtU on Accurate Step Counting looks interesting, although the paper is currently marked as Draft.
Posted by Carette at 11:55 AM | Comments (0)
June 16, 2005
Online math books
There are, of course, more and more but ars mathematica just posted a list of nice places too look for books online from the AMS and MSRI.
Googling around got me tons more:
- Digital Library at UPenn, QA index
- Directory at Georgia Tech
- Gallica project at the Bibliotheque Nationale de France contains a big list of scanned books
- impressive private list of online (mostly math) books
- Naturally, a list of links from Google
- The Numdam project is digitizing lots of older math
Posted by Carette at 08:40 PM | Comments (0)
June 14, 2005
Dependent Types and Cobol
Who would've thunk? Someone out there is using dependent types to understand Cobol programs, via type inference no less!
On the other hand, this may have some relevance to Coconut.
Posted by Carette at 02:07 PM | Comments (1)
Discrete Math for CS course
There is of course The Haskell Road, but Thorsten Altenkirch also teaches a Mathematics for Computer Scientists course using Haskell.
Posted by Carette at 01:47 PM | Comments (0)
June 04, 2005
Anti-unification
Also known as generalization -- the opposite of unification (substitution). There seems to be a fair literature out there (though significantly smaller than the unification lit.). In particular, see- A survey
- in the context of the Calculus of Constructions
- analogy by generalization, some more fanciful material from the AI community
- higher order generalization, and also in program verification
- E-anti-unification, with an implementation, where E- means modulo an equational theory, as well as a nice bibliography
- a general algorithm for second-order generalization
Posted by Carette at 10:37 PM | Comments (0)