Monthly Archives: August 2014

Using SQL Server to solve Einstein’s puzzles

A particular category of logic puzzles have to do with the satisfaction of constraints. Among those are the so called “Einstein’s puzzles”, also called “zebra puzzles“. The first time I saw such a puzzle was about 10 years ago. I … Continue reading

Posted in SQL Server | Comments Off on Using SQL Server to solve Einstein’s puzzles

How jectivity corresponds to morphisms

“Jectivity” may or may not be a real word in the dictionary and my command of the English language is not adequate for me to make such a discussion. But “jectivity” is indeed a valid mathematical word and it concerns … Continue reading

Posted in Science | Comments Off on How jectivity corresponds to morphisms

Absolute URLs vs. relative URLs vs. protocol relative URLs

Examples Absolute URL: http://yoursite.com/folder/subfolder/file.html Relative URL: /folder/subfolder/file.html Protocol relative URL: //anothersite.com/anotherfolder/anothersubfolder/anotherfile.html Tips Try to avoid absolute URLs. Try to use relative URLs for links inside your site. Try to use protocol relative URLs for links outside your site.

Posted in Web design | Comments Off on Absolute URLs vs. relative URLs vs. protocol relative URLs

Venn diagrams vs. Euler diagrams

In Venn diagrams, all areas (subsets) are shown. Areas that contain no elements (empty subsets) are filled with black color. In Euler diagrams, only areas that contain elements (non-empty subsets) are shown. If we want to depict all areas, irrespectively … Continue reading

Posted in Science | Comments Off on Venn diagrams vs. Euler diagrams

Arrow talk

On the Stack Overflow site, I found a great question titled Monads vs. Arrows. Essentially the OP (original poster) asks: “… When should I use monads and when should I use arrows?”. I answered the question and since I believe … Continue reading

Posted in Development | Comments Off on Arrow talk

Cheat sheet for Monads in Haskell

Let M be a Type Constructor, Functor, and Monad. As a Type Constructor, M can map a type a to the type M a. As a Functor, M can also map a function f to the function M f, using … Continue reading

Posted in Development | Comments Off on Cheat sheet for Monads in Haskell

The most significant FAQs about Haskell

Question: Function application and composition versus bind (>>=) Answer: For the following discussion, a, b, and c are built in Haskell data types. We use normal function composition when we compose a function a -> b with a function b … Continue reading

Posted in Development | Comments Off on The most significant FAQs about Haskell