Description:
Polymorphically-typed lazy purely-functional programming.
|
|
|
CFP: Commercial Users of Functional Programming (CUFP); Boston, MA Sep 22-24
|
| |
Greetings,
I am helping with the organization of CUFP this year. It is an excellent venue for discussing the application of functional programming languages and techniques. The talks are usually quite lively, and presents a great opportunity to influence language direction and design, the audience being a mix of practitioners and academics.... more »
|
|
|
WFLP 2013: Call for Papers
|
| |
============================== ============================== ==========
CALL FOR PAPERS
WFLP 2013
22nd International Workshop on Functional and (Constraint) Logic Programming
27th Workshop on Logic Programming
part of the Kiel Declarative Programming Days 2013... more »
|
|
|
Yesod/Persist (and/or general Haskell) problem
|
| |
Hello there,
as I'm very new to Haskell, could someone kindly push me into the
correct direction of solving the following problem...?
I started with Yesod's scaffolding application. Serving HTML generated
from database content works fine, but is there an elegant way to create
plain text responses iterating over database tables? Simple plain text... more »
|
|
|
Scalable and Performing Container for Network Packets
|
| |
I would like to solicit suggestions for the 'best' mechanism (in terms of scalability and performance) to use for the following problem:
The code monitors multicast packets on a port. The packets are parsed into a data definition that extracts a set of fields which are a mix of Strings... more »
|
|
|
real-time frame stuff
|
| |
Hello NG,
I'm new in this NG and pretty new to haskell too, so hi to everyone.
I am converting some of my image-processing routines from C to haskell,
as I found it faster to experiment like this.
First of all, I found a lot of libraries that do part of the stuff I need; what
I figured out is that the way to go is REPA.... more »
|
|
|
Space leak
|
| |
I had a space leak in a program that I distilled down to the following:
main = print $ length (replicateM 15 "012")
This should generate all the 15-digit ternary numbers (with leading 0's)
so the length of the list is 3**15=14348907. It gets that result
correctly, but uses almost a gigabyte of ram in computing it.... more »
|
|
|
Call-Site Code Replacement
|
| |
Dear All,
I just wonder whether it is possible in a functional
language to do call site replacement. I envision this
as a special form of lazyness.
Basically I would call somewhere a function f
with an argument a:
... (f a) ...
The function would then manage to replace itself
by a function g with an argument b:... more »
|
|
|
Call for Papers: ACCU 2013 conference
|
| |
ACCU invites you to propose a session for its leading software development conference.
The conference will be held in Bristol, England, from the 9th to the 13th April inclusive.
Our opening keynote speakers will be Eben Upton, Mr Raspberry Pi.
To propose a session please email the following information to confere...@accu.org... more »
|
|
|
