User loginNavigation 
Logic/DeclarativeDeclarative Networking: Language, Execution and OptimizationDeclarative Networking: Language, Execution and Optimization, Boon Thau Loo, Tyson Condie, Minos Garofalakis, David A. Gay, Joseph M. Hellerstein, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe and Ion Stoica.
I will be the first to admit that I somehow fundamentally do not get the logic programming style, but presenting a routing discovery protocol in about eight lines of code is pretty cool. By Tommy McGuire at 20060823 22:46  DSL  Logic/Declarative  2 comments  other blogs  6824 reads
Concoqtion: Mixing Indexed Types and HindleyMilner Type InferenceFrom the "Whoa!" files: Concoqtion: Mixing Indexed Types and HindleyMilner Type Inference
Another toughtocategorize one: dependent types, the CurryHoward Correspondence, logic programming, theorem provers as subsystems of compilers, implementation issues... it's all in here. Update: A prototype implementation is available here, but it took a bit of Googlefu to find, and it's brand new, so be gentle. Update II: The prototype implementation isn't buildable out of the box, and includes a complete copy of both the Coq and O'Caml distributions, presumably with patches etc. already applied. So it's clearly extremely early days yet. But this feels very timely to me, perhaps because I've just started using Coq within the past couple of weeks, and got my copy of Coq'Art and am enjoying it immensely. Update III: It occurs to me that this might also relate to Vesa Karvonen's comment about typeindexed functions, which occurs in the thread on staticallytyped capabilities, so there might be a connection between this frontpage story and the frontpage story on lightweight static capabilities. That thought makes me happy; I love it when concepts converge. By Paul Snively at 20060723 18:15  Functional  Implementation  Logic/Declarative  Semantics  Type Theory  3 comments  other blogs  9855 reads
Socially Responsive, Environmentally Friendly LogicSocially Responsive, Environmentally Friendly Logic
This paper seems to unify multiple interesting directions  logic, game semantics, concurrent constraint programming (and concurrent programming in general). At the same time it remains very accessible, without overwhelming amount of math, so can be hopefully useful not only for academics. I, for one, was waiting for exactly this kind of paper for two years (and my interest is very practical). Multiplayer CurryHoward correspondence, anyone? Or CurryHoward for web services? By Andris Birkmanis at 20060710 17:28  Category Theory  Logic/Declarative  Semantics  10 comments  other blogs  8796 reads
The First 10 Prolog Programming Contests
For your enjoyment... By Ehud Lamm at 20060701 17:00  Fun  Logic/Declarative  login or register to post comments  other blogs  6750 reads
Nested commits for mobile calculi: extending JoinNested commits for mobile calculi: extending Join
To me the main interest lies in section 4.2, which shows an encoding of a subset of AKL in cJoin. By Andris Birkmanis at 20060605 08:07  Logic/Declarative  Parallel/Distributed  Semantics  login or register to post comments  other blogs  5656 reads
Continuations for Parallel Logic ProgrammingContinuations for Parallel Logic Programming
This paper happens to combine several topics that interest me lately  AKL (a precursor of Oz), denotational semantics, continuations, and implementing programming languages in Haskell. If you share at least some of these interests  take a look! By Andris Birkmanis at 20060602 15:44  Logic/Declarative  Parallel/Distributed  Semantics  11 comments  other blogs  6480 reads
Constraint ProgrammingI have been reading a bit of late on Constraint Programming and thought I'd dump some of the links that have helped me along the way. One problem I find with learning Constraint Programming is that I easily get bogged down in the details of implementation and theory. In basic terms, CP consists of a three stage process: (1) Declare the domain (range) of the variables; (2) Declare the constraints on those variables; and (3) Search for solutions. The 1st and 2nd stages can be combined without too much loss, but there seems to be a general consensus that search should be kept separate as much as possible, since it usually is the most expensive and the least declarative. Most of the resources concentrate on the details about how to go about defining programs in these three stages, as well as giving hints about limiting the combinatorial explosion of the search. The best tutorial I've found is Finite Domain Constraint Programming in Oz which gives a pretty good practical introduction to the subject. Constraint Programming in Alice is a related work in progress that follows the same general outline. For those who like slide presentations, the lecture notes of Christian Schulte and Guido Tack are good resources. Both Christian and Guido are working on the implementation of Gecode, which is a set of libraries (in C++) that seek to take the model of computation spaces, as first realized in Oz, and extend their reach into other programming languages (Christian uses Java, while Guido uses Alice). For a more detailed look, Christian Schulte's PhD thesis on Programming Constraint Services is an in depth treatise on the use of computation spaces for CP. One book I've been eyeing is Constraint Based Local Search which uses COMET as the PL. My only hesitation is that I don't quite grok the concept of Local Search  a search method that is supposed to be quite efficient but not guaranteed to find a solution. Anyone care to hit me with a cluebyfour on Local Search? MicroKanrenHere's a very simple implementation of Kanren that gives the barest minimum to get the taste of logic programming in very simple Scheme. I am told that the code was written in about three hours at the meeting of a Functional Programming Group (Toukyou/Shibuya, Apr 29, 2006), as a quick illustration of logic programming. The code is very easy to read, and the comments are instructive and helpful. Enjoy! Typed Concurrent Programming with Logic VariablesTyped Concurrent Programming with Logic Variables
You may want to compare this with The Oz Programming Model (OPM), which
Another paper on OPM is The Operational Semantics of Oz. In short, the model of Plain is based on that of Oz with the main differences being:
By Andris Birkmanis at 20060505 08:33  Functional  Logic/Declarative  ObjectFunctional  Semantics  Type Theory  4 comments  other blogs  6998 reads
A Monadic Semantics for Core CurryA Monadic Semantics for Core Curry
While being primarily an "interpreter as semantics" paper, it looks like a nice example of a DSL in Haskell. As a bonus, it also discusses some features of logic programming. By Andris Birkmanis at 20060503 08:41  DSL  Implementation  Logic/Declarative  Semantics  login or register to post comments  other blogs  5572 reads

Browse archivesActive forum topics 
Recent comments
15 hours 47 min ago
16 hours 13 min ago
17 hours 8 min ago
20 hours 49 min ago
1 day 19 hours ago
1 day 19 hours ago
5 days 7 hours ago
5 days 22 hours ago
6 days 58 min ago
1 week 23 hours ago