Re: [Haskell] [Haskell-cafe] ANNOUNCE: ioctl 0.0.1

Did you managed to make it available for Windows? 2010-02-21 0:38 GMT+01:00 Maciej Piechotka : > A package for type-safe I/O control. Currently only ioctl is supported. > > Currently simply a extract from my tuntap fork > > TODO: > - Return the integer as well as structure (will break the API) >

Re: [Haskell] [Haskell-cafe] [ANN]: the Helium compiler, version 1.8.1

Great! How the type rules detailed in the "scripting the type inference engine" paper are implemented? it is possible to script the inference engine with such rules? If so, are there some examples? 2015-04-20 10:36 GMT+02:00 Jurriaan Hage : > Dear all, > > we have recently uploaded Helium 1.8.1

[Haskell] ANNOUNCE: hplayground: haskell client-side web framework

hplayground [1] is a haskell framework that compiles to JavaScript with the haste [5] compiler. It handles reactive effects under a applicative-monad that controls the modifications of the user interface. It is quite easy to create dynamic, composable applications using ordinary, beatiful, idiom

Re: [Haskell] ANNOUNCE: haste-perch

The readme in the Git repository tell more details https://github.com/agocorona/haste-perch/blob/master/README.md And also this blog post: http://haskell-web.blogspot.com.es/2014/06/taming-html-dom-with-monads-and-monoids.html 2014-06-18 19:20 GMT+02:00 Alberto G. Corona : > The syntax

Re: [Haskell] ANNOUNCE: haste-perch

ed - is it just the same thing but works with Haste, while > blaze-html doesn't? What's the main idea? > > Thanks! > Andrew > > > On Wed, Jun 18, 2014 at 7:02 AM, Alberto G. Corona > wrote: > >> Hi, >> >> haste-perch defines builder elements (per

[Haskell] ANNOUNCE: haste-perch

Hi, haste-perch defines builder elements (perchs) for Haste.DOM elements that are appendable, so that dynamic HTML can be created in the client in a natural way, like textual HTML, but programmatically and with the advantage of static type checking. It can be ported to other haskell-js compilers.

Re: [Haskell] Monad.Reader #23 call for copy

Hi Edward: I will send to you an updated copy of article about MFlow that I sent to you for the past issue of TMR. If you remember, we agreed to postpone it due to the quantity of material. So I have priority now!. Thanks 2013/12/18 Edward Z. Yang > Call for Copy: The Monad.Reader - Issue 2

Re: [Haskell] Call for Contributions - Haskell Communities and Activities Report, November 2013 edition

Hi Janis: This is my report about MFlow: MFlow is an innovative, Web framework of the kind of other functional, stateful frameworks like WASH(†) , Seaside Ocsigen or Racket. But MFlow does not use continuation passing, but a backtracking monad that carries out the synchronization of browser reque

Re: [Haskell] [Haskell-cafe] ANNOUNCE: MFlow 3.0

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 > My plan is to synchronize MFlow servers us

Re: [Haskell] [Haskell-cafe] ANNOUNCE: MFlow 3.0

;you can change the numbers in the boxes to see how the result > changes" > > Is that pretty or what? That's the code for this: > > http://mflowdemo.herokuapp.com/noscript/fviewmonad > > To me that's a real technological step over and above the usual servlets > parad

Re: [Haskell] [Haskell-cafe] ANNOUNCE: MFlow 3.0

ems to me that it is > be possible to solve this in Haskell where state can be serialized and > synchronized between multiple machines using Cloud Haskell, something that > is error-prone or impossible in other languages. But that step has never > been taken. > > Alexander >

Re: [Haskell] [Haskell-cafe] ANNOUNCE: MFlow 3.0

ewmonad > > To me that's a real technological step over and above the usual servlets > paradigm and I'd love to see more people getting involved. It seems like > Yesod and Happstack have a lot more manpower behind them, but unless I've > missed something, MFlow is goin

[Haskell] ANNOUNCE: MFlow 3.0

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 expr

Re: [Haskell] [Haskell-cafe] ANNOUNCE: btree-concurrent

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 aut

[Haskell] ANNOUNCE: MFlow-0.1.5

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 processe

[Haskell] ANNOUNCE: Workflow-0.5.8.0

This is A new version of the package workflow. I probably will change the name of this package since it is too generic. A workflow can be seen as a persistent thread that executes a monadic computation. Therefore, it can be used in very time consuming computations such are CPU intensive calcula

[Haskell] ANNOUNCE: TCache 0.8

Tired of your persistence layer? Take persistence the haskelll way. Besides the backward compatible stuff, TCache now defines persistent STM variables (DBRef's) that leverages the traditional haskell reference syntax to perform fast in-memory database transactions and inter-object references. It

[Haskell] Fwd: [Haskell-cafe] Question about memory usage

It is not repeated because fiblist is pure and has no arguments. Otherwise it would be repeated. 2010/8/14 Tako Schotanus > I was reading this article: > > http://scienceblogs.com/goodmath/2009/11/writing_basic_functions_in_has.php > > And came to the part where it shows: > > > > fiblist = 0 :

[Haskell] Announce: Properties-0.0.2

http://hackage.haskell.org/package/properties-0.0.2 Properties can use QuickCheck properties in the same way than assertions are used, for causal debugging of real programs. It also add an human readable structure for grouping properties for cl

[Haskell] ANNOUNCE IDynamic-0.1

IDynamic is variant of Data.Dynamic that can be indexed, serialized., stored, transmitted trough communications etc. So it can be used in abstract data containers, persistence, communications etc. http://hackage.haskell.org/package/IDynamic I Just uploaded it, so the documentation has not been c

[Haskell] ANN: Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4

Hi I'm proud to announce Workflow 0.5.5. This is a package intended to define workflows as sequences of actions with he usual do notation. Such actions may include wait for events, queue messages, etc perform processing etc for days weeks or even years without regards for shutdowns and restarts.

Re: [Haskell] ANNOUNCE: jhc 0.6.1

One question that is not clear in the documentation:Is JHC just a Haskell 98 compiler? Has some extensions? 2009/6/23 John Meacham > > Hi, this is to announce the release of jhc 0.6.1. The jhc homepage with > distribution information is at http://repetae.net/computer/jhc/ > > The main new featur

Re: [Haskell] ANNOUNCE: jhc 0.6.0 Haskell Compiler

The last version still uses a region inference algoritm instead of a garbage collector?. 2009/3/17 John Meacham > Hi, I am pleased to announce jhc 0.6.0, It has been a long time since an > official release, so there have been a lot of changes. Jhc is an > optimizing haskell compiler that focuses

[Haskell] ANNOUNCE: Data.TCache 0.5.5

The main addition of this versión is the capablity to safely handle transact, and serialize to permanent storage many datatypes simultaneously in the same piece of code and incrementally. Just register each new datatype (with registerType :: ). So it is not necessary to glue all types in advance i

[Haskell] announce: Workflow-0.1

I needed to to define multiuser web workflows in the most transparent way. I wondered if a state monad could transparently bring automatic checkpointing of each action and automatic resume after failure. In this way a long living computation could be expressed in a single monadic computation. Addi

Re: [Haskell] ANNOUNCE: RefSerialize-0.2.1

actualized to 0.2.3 due to some errors in the cabal description. Sorry, some needed module was not exported. 2008/11/2 Alberto G. Corona <[EMAIL PROTECTED]> > I uploadad > RefSerialize<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/RefSerialize> > to Hackage

Re: [Haskell] ANNOUNCE: RefSerialize-0.2.1

I uploadad RefSerialize to Hackage . Read, Show and Data.Binary do not check for repeated references to the same data address. As a result, the data is serialized multiple times when serialized. This is a waste of space in

[Haskell] ANNOUNCE: Data.TCache 0.5.1

I uploaded TCache to hackage.org. Data.Tcache is a transactional cache with configurable persistence. It tries to simulate Hibernate for Java or Rails for Ruby. The main difference is that transactions are done in memory trough STM. There are transactional cache implementations for some J2EE serve

Re: [Haskell] Announce: Yi 0.5.0.1

and.. integrated compiler error location in source code; Very important for rapid application development and overall: Integrated GHCI debugger: VERY important for Haskell Newbies. for understanding the haskell execution strategy. for interactive teaching. 2008/10/8 Jean-Philippe Bernardy <[EMAIL