Hi Spanish haskellers.
Maybe it is too late for the announcement, but we will have a meetup the
9th (next Tuesday).
Since the meetup group is devoted to functional programming in general, not
specifically Haskell, I will give an introduction to web programming in
Haskell: major platforms,
In MFow there is a Monad instance for formlets that make a lot of sense.
Apart from using liftIO inside an applicative formlets
it can do it that way also:
myBlogForm = do
t - liftIO getTime
Blog $ titleForm * return t * contentsForm
Which may look contrived, but instead of using
That was done around 100 years ago with COBOL.
2013/9/10 Vo Minh Thu not...@gmail.com
The syntax is actually used by non-technical people to write tests.
Using it to write Haskell code is a joke. (Using it for business
specification is not, even if for technical people this seems
overkill.)
There is also a meetup of the FP group in Madrid the 11th
http://www.meetup.com/FP-Madrid/events/137941442/?_af_eid=137941442_af=eventa=uc1_te
2013/9/6 Salvador Lucas slu...@dsic.upv.es
Hi,
There is a workshop on Functional Programming and also
a conference on programming languages
There is one Functional Programming meetup in Madrid. The first meeting was
in August. The next meeting is the 11th September (this month) . I couldn't
assist in September. I hope to see you in October!.
http://www.meetup.com/FP-Madrid/
2013/9/4 Eduardo Basterrechea eba...@molinodeideas.es
The paper is very interesting:
http://www.cs.indiana.edu/~sabry/papers/exteff.pdf
It seems that the approach is mature enough and it is better in every way
than monad transformers, while at the same time the syntax may become
almost identical to MTL for many uses.
I only expect to see the
For those who want to be productive rather than talkative masoquists (thus
said with all my love ;)), there are windows installers for Leksah and they
work perfectly well.
2013/8/9 David Virebayre dav.vire+hask...@gmail.com
Hi,
If you go the EclipseFP approach, you may have installations
One of the surprising things of Haskell is how little effort is done in
order to confer meaning to the names. That happens also in the case of the
mathematical language. Often they have a single letter. The reason is that
their meaning is completely defined by their signature and their
properties.
Fine reasoning.
Pure means incorruptible. It means that a pure result can be reused again
and again -like the gold or silver- while an impure result must be
re-created whenever it must be used. The metaphor is natural and I guess
that the use of pure (rather than referential transparent) is
You can define:
data EqDyn= forall a.(Typeable a, Eq a)= EqDyn a
instance Eq EqDyn where
(EqDyn x) == (EqDyn y)= typeOf x== typeOf y x== unsafeCoerce y
unsafeCoerce is safe synce the expression assures that types are equal
2013/7/20 adam vogt vogt.a...@gmail.com
On Sat, Jul 20, 2013 at
Matt
It is not return, but the bind the one that does the miracle of
multiplication.
By its definition for the list monad, it applies the second term once for
each element are in the first term.
So return is called many times. At the end, bind concat all the small
lists generated
2013/7/20 Matt
it to Hackage soon).
It uses also Control.Monad.Supervisor.Trace, that has a MonadLoc instance
for the Supervisor monad. You can create a MonadLogger instance taking as
example the MonadLoc one.
2013/7/17 Alberto G. Corona agocor...@gmail.com
Hi Greeg.
Nice I will publish the mechanism
Hi Eric:
The pattern may be the MonadCatchIO class:
http://hackage.haskell.org/package/MonadCatchIO-transformers
2013/7/18 Eric Rasmussen ericrasmus...@gmail.com
Hello,
I am writing a small application that uses a monad transformer stack, and
I'm looking for advice on the best way to
released rollbar for
error notification and would like to have as much line info as possible for
that.
On Tue, Jul 16, 2013 at 5:45 AM, Alberto G. Corona agocor...@gmail.comwrote:
It is important to have execution traces in case of error. specially in
server applications that run 24/7 such are web
It is important to have execution traces in case of error. specially in
server applications that run 24/7 such are web applications
Thanks to the wonderful package monadloc by Pepe Iborra, now MFlow can
generate a complete execution trace in case of error.
The control-monad-exception uses
. Besides Seaside, Racket is playing with the same ideas. They (Jay
McCarthy) have something to say about performance but I didn't quite
understand it.
On 10 July 2013 06:41, Alberto G. Corona agocor...@gmail.com wrote:
The third version of MFlow is out.
http://hackage.haskell.org/package/MFlow
However, besides state synchronization is under development, state
persistence in MFlow is optional, by using the workflow monad instead of
the IO monad. See for example this:
http://mflowdemo.herokuapp.com/shop
2013/7/10 Alberto G. Corona agocor...@gmail.com
My plan is to synchronize
I think that a non-non recursive let could be not compatible with the pure
nature of Haskell.
Let is recursive because, unlike in the case of other
languages, variables are not locations for storing values, but the
expressions on the right side of the equality themselves. And obviously it
is not
Don´t tried it and probably it does not even compile, but a possibility
could be along these lines:
catchExcept excepts handle e= do
if not . null $ filter ( \(SomeException e') - typeOf e= typeOf e')
excepts
then throw e
else handle e
use:
u= undefined
excluded=
McCarthy) have something to say about performance but I didn't quite
understand it.
On 10 July 2013 06:41, Alberto G. Corona agocor...@gmail.com wrote:
The third version of MFlow is out.
http://hackage.haskell.org/package/MFlow
MFlow is an all-heterodox web application framework, but very
Seaside, Racket is playing with the same ideas. They (Jay
McCarthy) have something to say about performance but I didn't quite
understand it.
On 10 July 2013 06:41, Alberto G. Corona agocor...@gmail.com wrote:
The third version of MFlow is out.
http://hackage.haskell.org/package/MFlow
MFlow
The third version of MFlow is out.
http://hackage.haskell.org/package/MFlow
MFlow is an all-heterodox web application framework, but very haskellish.
Now MFlow support restful URLs. It is the first stateful web framework to
my knowledge that supports it. The type safe routes are implicitly
the development of it
On Jun 20, 2013, at 2:56 PM, Alberto G. Corona agocor...@gmail.com
wrote:
Here is the example with better rendering and additional information as
well as some identifies issues to be solved.
http://haskell-web.blogspot.com.es/2013/06/the-promising-land-of-monadic
to be involved in
the development of this and other related concepts, please send me a
message.
2013/6/20 Alberto G. Corona agocor...@gmail.com
I don´t know how, but the google mail has changed the applicative functor
operator after (,) Left and Rigth by -.
2013/6/19 Alberto G. Corona agocor
Hi,
This is just to let you know the promising results of some experimentation:
Formlets are about applicative instances, but what about monadic instances?
What a Monad instance of formlets means? I recently experimented with this
and the results are very interesting and powerful- It mixes the
I don´t know how, but the google mail has changed the applicative functor
operator after (,) Left and Rigth by -.
2013/6/19 Alberto G. Corona agocor...@gmail.com
Hi,
This is just to let you know the promising results of some experimentation:
Formlets are about applicative instances
I have ever wondered how a committee could have made Haskell.
My conclusion is the following:
For one side there were many mathematicians involved, the authors of the
most terse language(s) existent: the math notation.
For the other, the lemma avoid success at all costs which kept the
In the package Workflow there is a DSL for workflow patterns that include
a very broad notion of voting using monoids. The other workflow
combinators resemble a lot the async package, but applied to workflows.
Maybe you can draw something from that to construct higuer level votation
DSL.
The
If you like to create a stand alone application I know that happstack was
created for stand-alone applications with no database, although Yesod and
Snap can do it as well. If your application is a-single-page-doit-all by
using a lot of JavaScript (or Fay) , then any of these restful frameworks
Not exactly what you ask, but it is noteworthy that the mind has different
logic processors. The fastest one work with IF THEN ELSE rules applied
specifically to deals. This is why your example (and most examples of
logic) involves a kind of deal expressed in the first person. This trigger
a fast
Hi Café:
I created just now an issue in cabal-dev:
https://github.com/creswick/cabal-dev/issues/101
When compiling old developments, I wish cabal-dev to install and build
dependencies that were available at a that time
I don't know if there are alternatives to solving this issue. I
The case of WASH is a pity. Architecturally It was more advanced that many
recent haskell web frameworks. The package would have been a success with
little changes in the DSL syntax.
I suspect that there are many outstanding packages with great ideas
abandoned, like WASH
2013/5/5 Brandon
#!topic/haskell-cafe/PrPtjw5GsHI
Thanks
Alberto
2013/5/5 Jurriaan Hage j.h...@uu.nl
Dear all (and in particular Alberto G. Corona and Stephen Tetley),
First of all, thanks Stephen for pointing out our work to Alberto.
Second, you may be interested to know that I just (as in two weeks ago
, but it was hard
to understand, just because the approach was original and unique.
I consider MFlow as a continuation of WASH in philosophical terms.
2013/5/6 Tom Ellis tom-lists-haskell-cafe-2...@jaguarpaw.co.uk
On Sun, May 05, 2013 at 10:46:23PM +0200, Alberto G. Corona wrote:
The case
Hi,
Just to share my excitement with you:
https://twitter.com/AGoCorona/status/329648864082677760
See the link in the tweet for an explanation
Best Regards,
--
Alberto.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
-
frictionfreedemocracy.org
2013/4/27 Ozgur Akgun ozgurak...@gmail.com
Hi,
On 27 April 2013 10:07, Alberto G. Corona agocor...@gmail.com wrote:
I created a ticket for the feature request:
Ticket #7870
Teachers, newbies and people working in Industry: Please push it!
A link to the ticket may be helpful
I created a ticket for the feature request:
Ticket #7870
Teachers, newbies and people working in Industry: Please push it!
2013/4/24 Alberto G. Corona agocor...@gmail.com
Maybe it is possible to do something In a google summer of code. Nothing
as sophisticated as the Helium paper
that permits postprocessing of GHC errors
and/or the identification of points in the current type checker where some
kind of rules can be defined by the programmer can be the first step.
2013/4/23 Brent Yorgey byor...@seas.upenn.edu
On Tue, Apr 23, 2013 at 12:49:59PM +0200, Alberto G. Corona
If you are not looking for the full reactive formalism but to treat event
driven applications in a procedural ,sequential, imperative way (whatever
you may call it) by means o continuations, then this is a good paper in
the context of web applications:
inverting back the inversion of control
Hi
I ever was worried about the barrier that the complexity of the Haskell
errors impose to users of DSLs. Many DSLs look so simple that even someone
without knowledge of Haskell can make use of them for some domains.
However when the program is compiled then al the monsters of the
deep appear
Stephen
The paper is very interesting. We need something like that:
... As a result, the beginning programmer is likely to be discouraged from
pro-gramming in a functional language, and may see the rejection of
programs as a nuisance instead of a blessing. The experienced user might
not look at
Thanks
The cancelative monoid is the right class for rolling back transactions, by
the way.
2013/3/22 Mario Blažević blama...@acanac.net
The new package monoid-subclasses [1] exports a number of classes that
sit between monoids and groups: ReductiveMonoid, CancellativeMonoid,
GCDMonoid,
No responses, but I'm sure that, like me, many laughed at this ;)
2013/4/2 Tom Murphy amin...@gmail.com
Oh, and happy April 1!
On Mon, Apr 1, 2013 at 6:16 AM, Tom Murphy amin...@gmail.com wrote:
Hi All,
Not particularly happy to announce the non-release of my latest
library, HBlog
/26 luc taesch luc.tae...@gmail.com
On 2013-03-25 19:00:42 +, Alberto G. Corona said:
It is possible as long as there is a empty event and there is a
operation that mix two events to créate an state and an operation that mix
an state and a event to créate an state.
I just read
) can be a monoid...
I figured out that the Writer monad may be good for that purpose.
On Mon, Mar 25, 2013 at 1:50 AM, Alberto G. Corona agocor...@gmail.comwrote:
That is the advantage of recording the sequence of events instead of the
final state: that the state don´t need
for their
serializable delimited continuations.
2013/3/25 Corentin Dupont corentin.dup...@gmail.com
Workflow is impressive! I didn't know you could serialize IO
states/computations.
On Mon, Mar 25, 2013 at 2:06 AM, Alberto G. Corona agocor...@gmail.comwrote:
the package Workflow serialize
That is the advantage of recording the sequence of events instead of the
final state: that the state don´t need to be seriallizable. And this
indeed the way to serlize something that can be decomposed in events. I
think that this is elegant.. Specially if the events and the state are
elements of
the package Workflow serialize also the state of a computation, so it can
be re-started and continued. It uses also the above mentioned event trick
to serialize the state.
By the way you can use the workflow monad transformer to recover the state
of the game. You don´t need to serialize anything
Additionally, Another way to include line number information and to
improve readability of the degugging code is to add verify as an
assert with flipped parameters so we can write:
let x= head xs `verify` (not $ null xs)
So the assertions appear on the right , separated from
The template look is very simple but it uses a lot of dynamic code behind
I changed the template to something more light.
http://haskell-web.blogspot.com.es/
2013/1/20 bri...@aracnet.com
On Thu, 17 Jan 2013 16:07:41 +0100
Alberto G. Corona agocor...@gmail.com wrote:
The entry in my
What is the schedule of the hackage builds?.
My package has been uploaded since three days ago, and it has not been
compiled yet...
--
Alberto.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Alberto G. Corona agocor...@gmail.com
What is the schedule of the hackage builds?.
My package has been uploaded since three days ago, and it has not been
compiled yet...
--
Alberto.
--
Alberto.
___
Haskell-Cafe mailing list
Haskell-Cafe
Anyway, Type checking is essentially an application of set theory : (I did
no search in te literature for this, It is just my perception). When I say
(+) :: Num a = a - a - a . I mean that (+) takes two elements of the
set of Num typeclass and return another. This is in principle a weak
Hayoo has them all:
2012/12/19 Radical radi...@google.com
Thanks, Petr.
I see that the comments are from years ago. Are there any ongoing efforts
to expand the default search set? (Or alternatively, to implement the
+hackage modifier mentioned.)
Is there interest in either of these
http://holumbus.fh-wedel.de/hayoo/hayoo.html
2012/12/19 Alberto G. Corona agocor...@gmail.com
Hayoo has them all:
2012/12/19 Radical radi...@google.com
Thanks, Petr.
I see that the comments are from years ago. Are there any ongoing efforts
to expand the default search set
Andrew:
There is a ListLike package, which does this nice abstraction. but
I don't know if it is ready for and/or enough complete for serious usage.
I´m thinking into using it for the same reasons.
Anyone has some experiences to share about it?
2012/11/10 Andrew Pennebaker
Thanks. I like the idea of BitCoin very much
I'll l try to integrate it in MFlow
2012/11/5 Clark Gaebel cgae...@uwaterloo.ca
Hello Cafe,
You've heard of the neat crypto-currency bitcoin[1], haven't you?
Well, I've just released network-bitcoin[2] which provides Haskell
bindings to the
Hi.
That´s fine. I missed an implementation of a persistent b-tree in haskell.
I planned to do my own, but it is not trivial task.
how the IO and STM is managed? . The serialization- deserialization is
automatic or programmer must write the cached blocks? (i suppose that the
block reads are
What hiders according with my experience, the understanding of this
generalization are some mistakes. two typical mistakes from my side was to
consider an arrow as a function, and the consideration of m as a kind of
container, which it is not from the point of view of category theory.
a - m b
The particular case from which the former is a generalization:
*instance Monad m = Monoid (a - a) where*
*mappend = (.)*
*mempty = id*
*
*
Here the monoid is defined for the functions within the set of values of
type a. There are no null elements.
2012/10/24 Alberto G. Corona agocor
You can include the type in the serialized string. When recovering you can
read the type and use to look for the appropriate deserializer in a lookup
table where you have registered the deserializer.
I use this trick in the IDynamic package,. that serializes-deserializes
dynamic types:
is cached).
Althoug this is not event sourcing, The logging and recovery facilities can
be used for even sourcing.
Alberto
2012/9/30 Marcelo Sousa dipyt...@gmail.com
Hi,
On Sun, Sep 30, 2012 at 4:22 AM, Alberto G. Corona agocor...@gmail.com
wrote:
It´´s a very iteresting concept
It´´s a very iteresting concept.
The Workflow Monad transformer [1], in Control.Workflow perform
logging and recovery of application istate from the log created.
It has no implementation of roll-back or limited recovery upto a
point, but this is easy to implement.
It also has many inspection and
and execute them
http://haskell-web.blogspot.com.es/2012/09/a.html
Alberto
2012/9/18 Alberto G. Corona agocor...@gmail.com
However if in a tab out of sync the user press refresh, the tab will
refresh to the current state.
I took care not to try to synchronize back as a consequence of a page
Just thinking aloud:
What if we add -current ?
pacage -current
Would select the versions of the package that were current art the time the
cabal file was uploaded and sucessfully compiled in hackage, if the packae
is installed from hackage
If the cabal file is local then current == any.
Hi haskellers and specially the web developers.
http://hackage.haskell.org/package/MFlow-0.1.5.3
MFlow is a is a Web framework with some unique, and I mean unique,
characteristics that I find exciting:
- It is a Web application server that start and restart on-demand
stateful web server
- options
mainf
where
linkShop= toHtml $ hotlink shop shopping
.
Alberto
2012/9/18 Alberto G. Corona agocor...@gmail.com:
Hi Jake
I don´t know what you mean with multiple tabs. The user management is
simple, anonymous clients are identified with a cookie. if the user
for the back
button. What happens if I open a couple new tabs in which I may or may
not go forward and backward. Do they all share the same state?
Different states (how?)? Partially shared states?
On Tue, Sep 18, 2012 at 12:33 PM, Alberto G. Corona agocor...@gmail.com
wrote:
Oh, I´m stupid. You
://hackage.haskell.org/packages/archive/MFlow/0.1.5.3/doc/html/MFlow-Forms.html#v:ask
option1 | option2
case r of
op1 - setGoStraighTo (Just goop1) goop1
op2 - setGoStraighTo (Just goop2) goop2
2012/9/18 Alberto G. Corona agocor...@gmail.com
Hi Jake
Moreover, `m a` is 'a' plus some terminal element , for example
Nothing, [], Left _ etc, So a morphism (a - m a) contains all the
morphisms of (m a - m a).
2012/9/5 Alberto G. Corona agocor...@gmail.com:
Alexander,
In my post (excuses for my dyslexia) I try to demonstrate
Thanks, Kristopher
2012/9/4 Kristopher Micinski krismicin...@gmail.com:
Your post feels similar to another one posted recently...
http://web.jaguarpaw.co.uk/~tom/blog/2012/09/02/what-is-a-monad-really.html
just fyi, :-),
kris
On Tue, Sep 4, 2012 at 6:39 AM, Alberto G. Corona agocor
, Sep 4, 2012 at 4:21 PM, Alexander Solla alex.so...@gmail.com
wrote:
On Tue, Sep 4, 2012 at 3:39 AM, Alberto G. Corona agocor...@gmail.com
wrote:
Monads are monoids in the category of endofunctors
This Monoid instance for the endofunctors of the set of all elements
of (m a) typematch
Monads are monoids in the category of endofunctors
This Monoid instance for the endofunctors of the set of all elements
of (m a) typematch in Haskell with FlexibleInstances:
instance Monad m = Monoid (a - m a) where
mappend = (=) -- kleisly operator
mempty = return
The article can
Not to mention the ugly formatting ;)
2012/9/5 Richard O'Keefe o...@cs.otago.ac.nz:
On 4/09/2012, at 10:39 PM, Alberto G. Corona wrote:
Monads are monoids in the category of endofunctors
This Monoid instance for the endofunctors of the set of all elements
of (m a) typematch in Haskell
Where the persistent part of the name comes from?. It can be
serialized/deserialized from a persistent storage automatically or on
demand?
2012/8/29 Tristan Ravitch travi...@cs.wisc.edu
I uploaded a package implementing persistent vectors using array
mapped tries (based on the implementation
For a caching library, I need to know the runtime usage of memory of the
program and the total amount of memory, the total memory used by all the
programs etc.
I need not do profiling or monitoring but to do different things inside my
program depending on memory usage.
The search is difficult
Joachim:
Thanks a lot
2012/8/27 Joachim Breitner m...@joachim-breitner.de
Hi,
Am Montag, den 27.08.2012, 18:20 +0200 schrieb Alberto G. Corona :
For a caching library, I need to know the runtime usage of memory of
the program and the total amount of memory, the total memory used
The problem of monads is that it defines different execution models,
besides the funcional,/lazy/declarative mode. There is no such problem in
imperative languages, which work ever in an hardwired IO monad. But this
means that the programmer has to code the extra behaviour needed in each
My pocket explanation:
While e a function gives one only value of the codomain for each element of
the domain set (and thus it can be evaluated a single time), a category is
a generalization that accept many graphs that goes from each element of the
domain to the codomain. For that matter getChar
That´s very good.
What tecnology, libraries etc did you use?
2012/5/3 Gintautas Miliauskas gintau...@miliauskas.lt:
Hello,
check out http://haskellonline.org, an online Haskell typechecker. It
is essentially a thin web wrapper over ghc, but it takes some friction
out of learning Haskell, if
Thinking aloud, I dónt know if the transition to more abstract type
signatures can be aleviated using language directives.
Someting like:
Restrict (++) String - String - String
that locally would restrict the type within the module.
Althoug it does not avoid breaking the old code, It permits
Fine ;)
So the transition should not be so problematic. An OldPrelude.hs may
be created easily with this.
Once again, thinking aloud.
2012/5/4 Malcolm Wallace malcolm.wall...@me.com:
On 4 May 2012, at 10:02, Alberto G. Corona wrote:
Restrict (++) String - String - String
that locally
the
computation can fail-back to the previous backpoint and so on. Doing
this with errorT result in a ugly syntax.
2012/3/29 o...@okmij.org:
Alberto G. Corona wrote about a monad to set a checkpoint and be able
to repeatedly go to that checkpoint and re-execute the computations
following
, Alberto G. Corona wrote:
In my package MFlow [1] I program an entire web navigation in a
single procedure. That happened in the good-old WASH web application
framework.
The problem is the back button in the Browser.
To go back in the code to the previous interactions when the data
input does
then fail
else lift $ print $ n2++n3
I wrote a blog entry about this :
http://haskell-web.blogspot.com.es/2012/03/failback-monad.html
2012/3/28 Alberto G. Corona agocor...@gmail.com:
Hi Haskellers.
In my package MFlow [1] I program an entire web navigation
Hi Stephen:
It could be:
It performs a rollback indeed.
I guess that this monad can be used in something similar to
nonblocking (multilevel) transactions.
if GoBack is changed to Goback String, and a trace string is
added to each NoBack step, then each NoBack step could sum the traces
of all
Hi Haskellers.
In my package MFlow [1] I program an entire web navigation in a
single procedure. That happened in the good-old WASH web application
framework.
The problem is the back button in the Browser.
To go back in the code to the previous interactions when the data
input does not match
Hi,
Just thinking aloud :
A way to start is to define concrete workflows for concrete events. What
It is necessary to do if. This may make things more explicit and to
clarify the problems. .Later, .maybe. these concrete workflows can be
abstracted away from procedural/imperative to declarative
Theoretically you only have to exec cabal install at the directory where
setup.hs is located. It is not necessary neither cygwin neither mingw
I guess
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I put Network Version 2.3.0.10 compiled for ghc.7.4.1 Windows (this
time without runtime errors) in the address refereed above. Just in
case someone want to avoid cabal configure-build and just want to
cabal install.
2012/2/13 Johan Tibell johan.tib...@gmail.com:
Resending as the last message
Bash? And can you post
the exact runtime error you get?
2012/2/8 Alberto G. Corona agocor...@gmail.com
I switched to Git bash and the runtime error produced by the library
is the same.
This error may be produced because the configuration it does not
detect the netwiorkin related includes
Hi Haskellers
I I´m happy to announce the first version of MFlow
http://hackage.haskell.org/package/MFlow
MFlow permits the execution of web applications in a procedural form,
that is, with multiple requests-response interactions in a single
procedure. MFlow stores the execution state, manage
! [valign top]
widget (Form (Nothing :: Maybe Prod) )
++ -- append Html after the widget
tr td ! [align center]
hotlink hello
(bold Hello World))
2012/2/7 Alberto G
Hi Johan,
The patch is not for the current version of network and the code is
quite different. Basically it is necesary to define this variable as
unsigned short that is the thing intended in the patch. however I
put it by brute force, without regard of the prerpocessor directives.
With this
to HAVE_WINSOCK2_H.
You might want to try that and report back if it works for you.
2012/2/7 Alberto G. Corona agocor...@gmail.com
Hi Johan,
The patch is not for the current version of network and the code is
quite different. Basically it is necesary to define this variable as
unsigned
:
Note that there are two branches on github, master and stable. You want the
latter.
On Feb 7, 2012 8:23 AM, Alberto G. Corona agocor...@gmail.com wrote:
This is quite different.
I don´t know how but I was looking at some other older patch around
the same issue and I supposed
they also check
for HAVE_WINSOCK_H.
2012/2/7 Alberto G. Corona agocor...@gmail.com
The code is evolving and none of the versions match exactily with the
patch, but substituting HAVE_WINSOCK by HAVE WINSOCK2 in these files
solves the compilation problem at least in the network 2.3.0.10
version
Reinhardt hreinha...@gmail.com:
I just use the version of MSys that is included with Git [1]. This puts a
Git bash icon on your desktop which you can then use to build the network
library.
[1] http://code.google.com/p/msysgit/
2012/2/7 Alberto G. Corona agocor...@gmail.com
Nothing bur a long
Hi,
After some pains, I compiled the package Network.
sa_family_t is needed in network.Socket.Internal.asc and MinGW seems
that it has no such variable defined.
I share here the package with the compiled binaries included:
improvements to the
formlets/digestive-functors concept!
- jeremy
On Feb 2, 2012, at 6:50 PM, Alberto G. Corona wrote:
I came across the idea that is easy to define additional operators to
Text.FormLets for adding custom HTML formatting.
Had anyone tried that?
For example to enclose the Prod
1 - 100 of 299 matches
Mail list logo
