I do understand the difference between theorem provers and Haskell programs.Logic can be used to reason 'about' Haskell programs and logic can be used 'within' Haskell programs.I am trying to clarify the difference between 'about' and 'within'Is approach 1 concerned with |= (model based
maybe this will help?
Haskell code in and of itself isn't special. proofs can happen with the
type system, but typically you'd want to define a target language and do
assertions about it, similar to how a compiler inspects it's input
programs. Haskell is not homoiconic nor is it like coq or
Reading the other thread (Adding Applicative/Functor instances to all
Monads in GHC) I was wondering if there was infrastructure for testing
what effect making the often-discussed Functor/Monad change would have:
How many packages on hackage would break etc.
I have read a few times that people
Has anyone surveyed the in-print textbooks, tutorials, or tried to
assess how much Haskell (H98, H2010, Glasgow Haskell?) is used in
teaching?
Having the wrong hierarchy is a minor annoyance to us members of the
cognoscenti, but a change outside a revision of the language standard
could leave a
There is a chicken and the egg problem with this argument.
Historically Haskell' has only considered changes that have been actually
implemented.
I would encourage the language standard to follow suit, but we survived a
similar autocratic minor change to Num with very little ecosystem
Hi,
Which library should I use for simple user interface? Should I use
opengl directly (through HOpenGL)? Or Gloss? Or something else?
I want to create small ui library from scratch in haskell.
Emanuel
___
Haskell-Cafe mailing list
Hello everyone,
I was playing with Word8 and list comprehensions and
the following examples came up. I have to admit the
behavior looks quite strange because it does not seem
to be consistent. Can someone shed some light on reason
behind some of these outputs?
By the way, I have abbreviated
Prelude 10 `mod` 256
0
So [1..10] == [1..0].
Cheers,
On Thu, May 16, 2013 at 6:15 PM, Jose A. Lopes jose.lo...@ist.utl.pt wrote:
Hello everyone,
I was playing with Word8 and list comprehensions and
the following examples came up. I have to admit the
behavior looks quite
This happens because of how fromInteger is defined for Word8. It maps
integers to integers mod 256. Also remember that 10 is actually
fromInteger 10, in all of your examples.
So your example is actually equivalent to [0..1 `mod` 256].
On May 16, 2013 2:19 PM, Jose A. Lopes
On Thu, 16 May 2013 23:15:33 +0200, you wrote:
Hello everyone,
I was playing with Word8 and list comprehensions and
the following examples came up. I have to admit the
behavior looks quite strange because it does not seem
to be consistent. Can someone shed some light on reason
behind some of
At risk of belaboring the now-obvious, note that the empty lists begin
at 1, which is 10^8, and thus the first power of 10 evenly
divisible by 2^8.
The largest value in the list for each 10^n is likewise 0 modulo 2^n.
(Figuring out why the sequence has those particular multiples of 2^n
is
* o...@okmij.org o...@okmij.org [2013-05-11 05:26:55-]
I must say though that I'd rather prefer Adres solution because his
init
init :: (forall a. Inotify a - IO b) - IO b
ensures that Inotify does not leak, and so can be disposed of at the
end. So his init enforces the region
I want to convert lambda expressions into a vocabulary of monoidal
categories, so that they can be given multiple interpretations, including
circuit generation and timing analysis, and hopefully some other far-out
alternatives (3D visualization, animated evaluation, etc). More
specifically, I want
13 matches
Mail list logo
