Re: [Haskell-cafe] Interest in typed relational algebra library?
And yes to first order predicate calculus too!
Just two weeks ago Chung-chieh Shan and I were explaining at NASSLLI the embedding in Haskell of the higher-order predicate logic with two base types (so-called Ty2). The embedding supports type-safe simplification of formulas (which was really needed for our applications). The embedding is extensible: you can add models and more constants. http://okmij.org/ftp/gengo/NASSLLI10/course.html#semantics
On Tue, 10 Jul 2012, oleg@okmij.org wrote:
And yes to first order predicate calculus too!
Just two weeks ago Chung-chieh Shan and I were explaining at NASSLLI the embedding in Haskell of the higher-order predicate logic with two base types (so-called Ty2). The embedding supports type-safe simplification of formulas (which was really needed for our applications). The embedding is extensible: you can add models and more constants.
Oleg, thank you. Which article should I read first? oo--JS.
On Wed, 18 Jul 2012, Jay Sulzberger wrote:
On Tue, 10 Jul 2012, oleg@okmij.org wrote:
And yes to first order predicate calculus too!
Just two weeks ago Chung-chieh Shan and I were explaining at NASSLLI the embedding in Haskell of the higher-order predicate logic with two base types (so-called Ty2). The embedding supports type-safe simplification of formulas (which was really needed for our applications). The embedding is extensible: you can add models and more constants.
Oleg, thank you. Which article should I read first?
oo--JS.
Ah, I see that the files are Haskell source files, and not Postscript files. The order is clear. oo--JS.
participants (2)
-
Jay Sulzberger -
oleg＠okmij.org