Typed Logic

Incorporates strong typing over predicate logic programming, and, conversely, incorporates predicate logic programming into strongly typed functional languages. The style of predicate logic is from Prolog; the strongly typed functional language is Haskell.

Pages

▼

Monday, September 29, 2008

Animal as RDR, part III

Examples: Building, running and modifying RDR systems The previous entries showed the implementation of the model of a simple Ripple-Down ...

Friday, September 19, 2008

Animal as RDR, part II

Implementation study In the last entry , we introduced what RDR (ripple-down rules) are and reviewed the types that comprise an example syst...

Thursday, September 18, 2008

Animal: an RDR implementation study, part I: types

Synopsis Ripple-down rules provide a fast and efficient representation of knowledge in context for use, e.g., by expert systems. We prese...

Wednesday, September 10, 2008

What is declarative programming?

The concept has been bandied about, and has entered into more popular discussion with the broad acceptance of XML. Beside the overall defin...

Tuesday, September 2, 2008

Fuzzy unification parser in Haskell

Synopsis This is a short paper on building a scanner/parser for a fuzzy logic domain-specific language (DSL). The system takes as input a f...

Monday, September 1, 2008

A stream of primes as Comonad

I figured I've beaten enough around this bush to encircle it with a path half-a-meter in depth. So, I've finally decided to bear do...

Friday, August 29, 2008

Earning ⊥-Trophies

I recall a quote stating that a person learns Haskell by reinventing the standard library. I'm still learning Haskell. Marvel Comics w...

View web version

Powered by Blogger.