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, June 23, 2014

matchingSub is Comonadic (obviously!)

So! Today’s 1HaskellADay problem was an interesting NP-hard problem ... until I reread the problem statement carefully, then it becam...

Saturday, June 21, 2014

keepEquals with Difference Lists

Yesterday's 1HaskellADay exercise was keepEqual but it could have easily have been ‘keepSimple’ or ‘write this in your sleep’ or ......

Wednesday, June 18, 2014

oh : so True

So, ... So, I'm going to say 'so' a lot in this post. You'll find out why this is, soonest. soon, adv: composite word of...

Tuesday, June 17, 2014

No Roam at the Inn(sbruck)

Okay, so, for yesterday's 1HaskellADay problem (about 'collect'ing 'stuff' from 'room's), we’re looking at a ...

Monday, June 2, 2014

That's totes my Bag!

So, does that mean I like tote-bags? So, today's question on @1HaskellADay was this: write a function countOccurences :: [Stirng] ...

Sunday, May 25, 2014

Gödel Numbering for LYNE

What is the Gödel numbering for LYNE puzzles ? I propose, there exists a number, L, such that it describes each LYNE puzzle, such that L...

Wednesday, April 30, 2014

'Z' is for the ζ-calculus

'Z' is for ζ-calculus (pronounced 'zeta-calculus') So, 'Z' is the last letter of the alphabet, unless you...

View web version

Powered by Blogger.