By: Roman Movchan
You might be interested to know that in the Aha! programming language, designed by me, the Boolean data type is just missing. Although anyone can define it if needed, no language construct relies on...
View ArticleBy: Nathan Bouscal (@nbouscal)
“Except… here’s the problem. Are we talking about computers?” No!! We absolutely are not talking about computers. We’re talking about computation, which is much, much more general than “what one does...
View ArticleBy: Carter Charbonneau (@fread2281)
I don’t see how (Set,Bool) (or Bool with a phantom type argument) doesn’t work just as well. Personally, I think that Bool is a *better* representation than Equality because you don’t have to lie to...
View ArticleBy: sambocyn
yeah well see after I read this article I re-factored a Bool into a Maybe, and the call stack of functions that felt wrong became easier to think about. no “ivory”.
View ArticleBy: sambocyn
maybe the author would say that {isprime} and {(<k)} should return {Maybe Int} not {Bool}?
View ArticleBy: Robert Harper
It’s hard to make a blanket statement, but in the sense of this post, yes. I see this as akin to the much more sophisticated ideas of Kurt Mehlhorn on building certifying algorithms. For example,...
View ArticleBy: Boolean blindness | The Lumber Room
[…] From here (blog post by Robert Harper, his advisor at CMU): […]
View ArticleBy: dwrensha comments on "Destroy All Ifs – A Perspective from Functional...
[…] I recommend Bob Harper’s essay on “boolean blindness”: https://existentialtype.wordpress.com/2011/03/15/boolean-bli… […]
View ArticleBy: danielbrice
Interestingly, the world of research Mathematics is also divided into two camp: the “theory builders” and the “problem solvers”. The theory builders (analogous to your logicians) are concerned with...
View Article
