Inklings: a tumblelog

On combining functional and relational programming. From LtU:

This is fairly well-trodden ground now, with approaches such as Miller’s lambda-Prolog and Saraswat’s constraint-lambda calculus being well established, but this paper offers a rather different approach, based on the Henkin-Monk-Tarski approach of cylindric algebras, which were devised as a means of formalising predicate logic in equational logic–I’m familiar with them in the context of modal logic, since they offer a means for handling quantifiers by means of modalities, where [] is used to express forall and <> is used to express exists.