aditya siram aditya.siram at gmail.com writes:
I was fooled :). Some indication of that on the page would be very
helpful.-deech
Bulat was dreaming about better Lua support, but since the thing fulfilled
my purpose, Bulat's dreams never got implemented.
Aditya, I'm eager to accept patches,
Hi,
I hypothesize that at type level Haskell offers a form of equational
logic. At type level the following program[1] could be interpreted as a
first order program in equational logic where;
1)Data types represent declarations of constructors (both constants and
functions)
2)Type synonyms
Romain,
2010/10/25 Romain Demeyer r...@info.fundp.ac.be:
I'm working on static verification in Haskell, and I search for existing
works on specification of Haskell programs (such as pre/post conditions, for
example) or any other functional language. It would be great if there exists
a prover
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 10/24/10 06:59 , Andrew Coppin wrote:
now I can't seem to find it. Instead, I had to navigate to the Unix download
page, download the source tarball, untar it (non-trivial under Windows), and
I thought WinZip added tar and tar.gz several years
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 10/25/10 10:49 , Brandon S Allbery KF8NH wrote:
On 10/24/10 06:59 , Andrew Coppin wrote:
now I can't seem to find it. Instead, I had to navigate to the Unix download
page, download the source tarball, untar it (non-trivial under Windows), and
On Monday 25 October 2010 16:51:13, Brandon S Allbery KF8NH wrote:
On 10/25/10 10:49 , Brandon S Allbery KF8NH wrote:
On 10/24/10 06:59 , Andrew Coppin wrote:
now I can't seem to find it. Instead, I had to navigate to the Unix
download page, download the source tarball, untar it
Not exactly answering your question, but just in case you hadn't
checked, there are a few packages for type level natural numbers on
hackage, which do the same things as the program below. The packages
are:
- type-level-natural-number and co by Gregory Crosswhite, and
- type-level-numers by
Andrew Coppin schrieb:
I'd like to have a go at writing CGI in Haskell. However, I don't really
want to install and configure the likes of Apache just to quickly test a
simple CGI script. I was hoping that I could find a trivial little HTTP
server on Hackage somewhere that would be just a
On 25/10/2010 03:49 PM, Brandon S Allbery KF8NH wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 10/24/10 06:59 , Andrew Coppin wrote:
now I can't seem to find it. Instead, I had to navigate to the Unix download
page, download the source tarball, untar it (non-trivial under Windows),
On 15/10/2010 09:42 PM, Gregory Collins wrote:
Andrew Coppinandrewcop...@btinternet.com writes:
Does anybody have any idea which particular dialect of pure math this
paper is speaking? (And where I can go read about it...)
It's pretty garden-variety programming language/type theory.
Dear all,
I am pleased to announce to you that, on the occasion of BelHac, the first
Belgian Haskell Hackathon from 5-7 Nov 2010, the Ghent Functional Programming
Group is organizing a symposium on Functional Programming in Industry, to
which you are all cordially invited. These talks will be
On 25 October 2010 22:10, Andrew Coppin andrewcop...@btinternet.com wrote:
If I were to somehow obtain this book, would it actually make any sense
whatsoever? I've read too many maths books which assume you already know
truckloads of stuff, and utterly fail to make sense until you do. (Also,
Andrew Coppin andrewcop...@btinternet.com writes:
On 15/10/2010 09:42 PM, Gregory Collins wrote:
It's pretty garden-variety programming language/type theory.
Hypothesis: The fact that the average Haskeller thinks that this kind of dense
cryptic material is pretty garden-variety notation
On Mon, Oct 25, 2010 at 10:10:56PM +0100, Andrew Coppin wrote:
Type theory doesn't actually interest me, I just wandered what the
hell all the notation means.
That sounds like an oxymoron. How could you possibly learn what the
notation means without learning about the subject that the notation
Patrick,
Thanks for taking the time to get the program running.
It seems fine, but I cannot get the *md* to print out, probably missing
the Show class somewhere.
Thanks again,
Pat
Patrick LeBoutillier wrote:
Patrick,
I found this program interesting and decided to spend a bit of time on
Patrick,
On Mon, Oct 25, 2010 at 6:12 PM, Patrick Browne patrick.bro...@dit.ie wrote:
Patrick,
Thanks for taking the time to get the program running.
It seems fine, but I cannot get the *md* to print out, probably missing
the Show class somewhere.
md is a function to which you have to give a
On Oct 25, 2010, at 2:10 PM, Andrew Coppin wrote:
Hypothesis: The fact that the average Haskeller thinks that this
kind of dense cryptic material is pretty garden-variety notation
possibly explains why normal people think Haskell is scary.
Maybe, but the notation is still clearer than
Hi,
I've tried to make simple monadic happy parser with monadic lexer, but even
trivial parser (attached) outputs:
Ok \r\n
instead of string from 'sample' file.
Seems I can't spot error by myself, so I need your help, guys.
Thanks in advance,
Roman.
HappyAlexProblem.tar.gz
Description: GNU Zip
On Oct 25, 2010, at 2:10 PM, Andrew Coppin wrote:
Type theory doesn't actually interest me, I just wandered what the
hell all the notation means.
Sorry for the double email.
I recommend Language , Proof, and Logic, by Barwise and
Etchemendy. It doesn't go into type theory (directly).
19 matches
Mail list logo
