Types in Lisp and Scheme
I see now that Racket has types. At first glance it seems to be almost identical to Haskell typing. But is Lisp’s CLOS covering some of the space Haskell types cover? Creating a very strict Haskell type and an object in any OO language seems vaguely similar. It’s just that I’ve drunk some of the Haskell kool-aid and I’m totally paranoid that if I go down the Lisp road, I’ll be screwed due to dynamic typing.
Why have a wrapper constructor when storing a function in a data type?
I can never do too many Haskell tutorials. There is always something to refine and learn. So, I am working through chapter 10 of Real World Haskell, and everything makes sense.
In what programming language did “let” first appear?
I was wondering about the origins of the “let” used in Lisp, Clojure, and Haskell. Does anyone know which language it appeared in first?
Why does Haskell have built-in “if/then/else” instead of defining it as a simple library function?
Why does Haskell have a built-in if/then/else, which is dependent on the Bool type, instead of having a simple library function? Such as
Necessity to learn haskell language extension for production
Haskell core language is really simple. Coming from an OO background, the main difficulty is to adapt to the pure functional paradigm.
Exclude the zero in the given data in Haskell [closed]
Closed 11 years ago.
Exclude the zero in the given data in Haskell [closed]
Closed 11 years ago.
Could we build a functional computer?
As mush as FP has done, in the end, all our programs are structured.
That is, it doesn’t matter how pure or functional we make a them – they are always translated to assembly,
so what actually runs behind the hoods are instructions, states and loops.
We are kind of emulating FP.
Modern REPL for Haskell – is anybody working on it? [closed]
It’s difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 11 years ago. It’s time Haskell had a modern REPL like […]
What is the name of λx.λf.fx (like reverse apply) in lambda calculus? Does the corresponding function have a standard name in programming?
What is the name of λx.λf.fx in lambda calculus?