2010/1/12 Günther Schmidt gue.schm...@web.de:
[Snip...] I need to write my own parsec-token-parsers to parse this token
stream in a context-sensitive way.
Uhm, how do I that then?
Hi Günther
Get the Parsec manual from Daan Leijen's home page then see the
section '2.11 Advanced: Seperate
On Mon, 2010-01-11 at 19:59 -0500, Keith Sheppard wrote:
so what should I make of these errors? Are they useful in some way or
just a problem with the build environment?
The latter.
(If that's the case I think they should probably be removed since
they're confusing for potential users)
It
On Mon, 2010-01-11 at 09:30 -0800, Andrey Sisoyev wrote:
Svein Ove Aas wrote:
In this case, LGPL is a problem. It requires you to offer a way to
re-link such binaries against new versions/implementations of the
library, which in practice requires it to be either open source or
2010/1/12 Duncan Coutts duncan.cou...@googlemail.com:
On Mon, 2010-01-11 at 09:30 -0800, Andrey Sisoyev wrote:
Svein Ove Aas wrote:
In this case, LGPL is a problem. It requires you to offer a way to
re-link such binaries against new versions/implementations of the
library, which in
2010/1/12 Günther Schmidt gue.schm...@web.de:
Hi all,
I've used Parsec to tokenize data from a text file. It was actually quite
easy, everything is correctly identified.
So now I have a list/stream of self defined Tokens and now I'm stuck.
Because now I need to write my own
Daniel Fischer wrote:
Why has
mergeSP (a,b) ~(c,d)
= let (bc,b') = spMerge b c in (a ++ bc, merge b' d)
a memory leak, but
mergeSP (a,b) ~(c,d)
= let (bc,m) = spMerge' b c d in (a ++ bc, m)
not?
Well, looking at the core for mergeSP, the fog clears somewhat. The former
is
As I said I've been using Parsec quite a lot, but wonder if there is
a different approach possible/feasible to parsing. Parsec (2x) isn't
an online parser, ie, it doesn't produce a result before the whole
parse is completed.
There is AFAIK one alternative, the uulib,
In addition, the
On Tue, Jan 12, 2010 at 10:24:22AM +0100, minh thu wrote:
2010/1/12 Duncan Coutts duncan.cou...@googlemail.com:
Any user can then perform the last step themselves and if they're really
lucky they might get that to work with a slightly modified version of
the LGPL'ed package. In practise of
2010/1/12 Pasqualino Titto Assini tittoass...@gmail.com:
The frisby parser (http://repetae.net/computer/frisby/) that
unfortunately is not well known as it has never been uploaded on
hackage also supports lazy parsing.
Doaitse Swierstra's new version of UU supports online parsing too:
On Tue, 2010-01-12 at 10:24 +0100, minh thu wrote:
In short, if I understand you correctly, you would just have to
provide your code in unlinked form regardless of the existence of some
tool to create another ABI-compatible version of the LGPL library.
Right.
The procedure I mentioned is
Am Dienstag 12 Januar 2010 11:30:07 schrieb Heinrich Apfelmus:
Tricky stuff. It is known that pairs/records are prone to unwanted
retention, see for example the recent thread
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66903/focus=67871
or
Jan Sparud. Fixing some space leaks
Hi,
I'm just introducing myself to Happstack. I come across an example page
where HTML and haskell code is mixed.
Is this how happstack produces html, it's haskell code embedded in HTML?
Günther
___
Haskell-Cafe mailing list
Hi,
is WASH still active, what's the current status of it?
I'm looking for a Haskell version of Smalltalk's Seaside, at first
glance WASH seems to come close.
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
The example you came across is probably using HSP [1] to generate
HTML. Happstack isn't tied to a specific method of generating HTML.
You could use HSP or other libraries such as html-minimalist [2],
xhtml [3], HStringTemplate [4], or even plain old manual construction
of strings.
[1]
В сообщении от 12 января 2010 03:35:10 Günther Schmidt написал:
Hi all,
I've used Parsec to tokenize data from a text file. It was actually
quite easy, everything is correctly identified.
So now I have a list/stream of self defined Tokens and now I'm stuck.
Because now I need to write my
Hi Günther,
the ideas of WASH will never die.
However AFAIK the implentation has never been updated to work with
servers such as HappStack. I may be wrong about this.
I tried making WASH perfect by getting 100% DTD validation:
http://github.com/MarcWeber/vxml
Somewhen I was lost in the type
[1] http://www.cs.chalmers.se/~d00nibro/hsp/
Oops. Seeing this link was a rather painful reminder that I ought to
update that page. Last update was 2005, HSP has evolved quite a lot
since then...
The best way to get info on HSP in its current state is probably to
check out some of the stuff
On Jan 12, 2010, at 1:38 PM, Duncan Coutts wrote:
But that is the intent of the LGPL, to protect the rights of the users
*receiving* the code, not to guarantee that modifications are
available
to the entire world.
I wonder whether the following statements are valid:
When I write a
On Jan 12, 2010, at 8:46 PM, Sebastian Fischer wrote:
Am I allowed to distribute the sources under BSD3 and the binary
under LGPL?
Would that make sense? Maybe not, because anyone who distributes a
binary of my program or derivative work must license it under LGPL
anyway.
Well it may
Sebastian Fischer s...@informatik.uni-kiel.de writes:
I wonder whether the following statements are valid:
You want my layman's opinion?
When I write a program that uses an LGPL library, I am allowed to
distribute the *sources* of my program under a permissive (non-
copyleft) license like
Trying to get ssh working via putty from behind my company firewall.
Had some success in the past with sourceforge because they had ssh
daemons listening on ports 80 and 443, to aid prisoners like myself.
Does anyone know if the monk (darcs.haskell.org) and nun
(code.haskell.org) servers accept
Monk and nun?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2010/1/12 Jason Dusek jason.du...@gmail.com:
Monk and nun?
The haskell.org code/project/... servers:
http://www.haskell.org/haskellwiki/Haskell.org_domain
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Trying to get ssh working via putty from behind my company firewall.
Had some success in the past with sourceforge because they had ssh
daemons listening on ports 80 and 443, to aid prisoners like myself.
Does anyone know if the monk (darcs.haskell.org) and nun
(code.haskell.org) servers
OK people, it's random statistics time!
Haskell '98 apparently features 25 reserved words. (Not counting
forall and mdo and so on, which AFAIK are not in Haskell '98.) So
how does that compare to other languages?
C: 32
C++: 62
Borland Turbo Pascal: ~50 [without the OOP extensions added
Haskell '98 apparently features 25 reserved words. (Not counting forall
and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
import, in, infix, infixl, infixr, instance, let, module, newtype, of,
then, type, where. There's also
Niklas Broberg wrote:
Haskell '98 apparently features 25 reserved words. (Not counting forall
and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
import, in, infix, infixl, infixr, instance, let, module, newtype, of,
Hi all,
I want to use Sigbjorn's com-package to do some automation under Windows.
There seems to be some program HaskellDirect wich can create Haskell
modules from type-libs, it's mentioned in the examples to the com
package on Sigbjorn's site http://haskell.forkio.com/com-examples .
Cabal
Am Dienstag 12 Januar 2010 23:12:20 schrieb Niklas Broberg:
Haskell '98 apparently features 25 reserved words. (Not counting
forall and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
import, in, infix, infixl, infixr,
Daniel Fischer wrote:
Am Dienstag 12 Januar 2010 23:12:20 schrieb Niklas Broberg:
Haskell '98 apparently features 25 reserved words. (Not counting
forall and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
import,
Am Dienstag, den 12.01.2010, 22:22 + schrieb Andrew Coppin:
Niklas Broberg wrote:
Haskell '98 apparently features 25 reserved words. (Not counting forall
and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
Andrew Coppin wrote:
OK people, it's random statistics time!
Haskell '98 apparently features 25 reserved words. (Not counting
forall and mdo and so on, which AFAIK are not in Haskell '98.) So
how does that compare to other languages?
C: 32
C++: 62
Borland Turbo Pascal: ~50 [without the
Tony Morris wrote:
Andrew Coppin wrote:
Java: 50
Java has 53 reserved words.
Damnit. They must have added a few more...
(The material I quoted from had notes about which version of Java added
certain of the words. I guess it was outdated.)
Hello Andrew,
Wednesday, January 13, 2010, 1:54:44 AM, you wrote:
(The material I quoted from had notes about which version of Java added
certain of the words. I guess it was outdated.)
you would be more respected in this list if you will compare haskell 1.0
with java'2010 or better '2020 ;)
Occasionally I have a function with an unused argument, whose type I
don't want to restrict. Thus:
f :: _unused - A - B
f _ a = b
Since it's a little unusual, I try to make it clear that the type is
intentionally ignored. But it makes me wonder, would it make sense to
allow _ as a type
Le mardi 12 janvier 2010 à 21:25 +, Andrew Coppin a écrit :
Hi Andrew,
As you can see, this conclusively proves... something.
What, exactly?
Take Eiffel in its last version: I have identified 11 keywords that are
either used for Design By Contract or source-code documentation. These
are
Hi,
Here is the first release of Atom's Formal Verifier (AFV) [1], a tool
intended to verify Atom -- or human -- generated C code. With the
help of the Yices SMT solver [2], AFV uses bounded model checking and
k-induction to verify assertions in iteratively called C functions,
such as an
Hi,
I sometimes strumble on the same quiestion that forces me to insert
functions that process objects of a certain class inside their class
definition. This occurs when a computation uses the object internally,
neiter as parameter or as a return value or in the case of existential
types. An
Alberto,
On Tue, Jan 12, 2010 at 7:17 PM, Alberto G. Corona agocor...@gmail.com wrote:
Hi,
I sometimes strumble on the same quiestion that forces me to insert
functions that process objects of a certain class inside their class
definition. This occurs when a computation uses the object
Andrew Coppin wrote:
OK people, it's random statistics time!
OK, my version of meaningless statistics:
C++ (ISO/IEC 14882:1998(E)): 325 pages (712 including standard libraries)
C# (ECMA-334): 505 pages (language only)
Java: 450 pages (language only?)
Scala (2.7): 125 pages (157 including
On Jan 12, 2010, at 17:38 , Michael Hartl wrote:
Also, the number varies depending on whether you consider reversed
words or keywords, and I suspect the situation is subtly different
reversed words? There are some in sh for example, namely 'fi' and
'esac', but other than that they are not that
On Jan 12, 2010, at 17:12 , Niklas Broberg wrote:
Haskell '98 apparently features 25 reserved words. (Not counting
forall
and mdo and so on, which AFAIK are not in Haskell '98.)
21 actually. case, class, data, default, deriving, do, else, if,
import, in, infix, infixl, infixr, instance, let,
Andrew == Andrew Coppin andrewcop...@btinternet.com writes:
Andrew It's weird that us Haskell people complain about there
Andrew being only 26 letters in the alphabet
Which alphabet?
You have plenty of choice in Unicode.
--
Colin Adams
Preston Lancashire
Note: I'm relatively new to Haskell, and my knowledge of C and C++ is
basically pretty
minimal -- I can read, modify and compile C/C++ programs (usually).
I'm trying to interface with some C++ code by writing a little bit of C code
that uses that C++ code,
and I'm getting undefined reference
On Jan 13, 2010, at 00:57 , DNM wrote:
- srilm.c
// Initialize and read in the ngram model
Ngram* bldLM(int order, const char* filename) { ... }
...
// Delete the ngram model
void deleteLM(Ngram* ngram) {
delete srilm_vocab;
delete ngram;
}
...
// Get the ngram
hledger does this, using happstack (or in theory, any hack back end). http://joyful.com/repos/hledger/Commands/Web.hs
might give some ideas.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
46 matches
Mail list logo
