Lezama (MIT, USA)
Sam Staton (U. Cambridge, UK)
Viktor Vafeiadis (MPI-SWS, Germany)
Kapil Vaswani (MSR, India)
Martin Vechev (IBM, USA)
Peng Wu (IBM, USA)
Hongseok Yang (Queen Mary U. London, UK)
Pen-Chung Yew (Academia Sinica, Taiwan)
ORGANIZERS:
Mike Dodds, U. Cambridge (Poster chair)
Shin-Cheng Mu,
-oriented generic programming,
* and so on.
Organizers
--
Co-Chair
Jaakko Järvi, Texas A&M University, USA
Co-Chair
Shin-Cheng Mu, Academia Sinica, Taiwan
Programme Committee
---
Dave Abrahams, BoostPro Computing, USA
Magne Haveraaen, Universitetet i Bergen, No
Lezama (MIT, USA)
Sam Staton (U. Cambridge, UK)
Viktor Vafeiadis (MPI-SWS, Germany)
Kapil Vaswani (MSR, India)
Martin Vechev (IBM, USA)
Peng Wu (IBM, USA)
Hongseok Yang (Queen Mary U. London, UK)
Pen-Chung Yew (Academia Sinica, Taiwan)
ORGANIZERS:
Mike Dodds, U. Cambridge (Poster chair)
Shin-Cheng Mu,
polymorphism,
* object-oriented generic programming,
* and so on.
Organizers
--
Co-Chair
Jaakko Järvi, Texas A&M University, USA
Co-Chair
Shin-Cheng Mu, Academia Sinica, Taiwan
Programme Committee
---
Dave Abrahams, BoostPro Computing, USA
Magne Haver
Hi,
On Tue May 26 01:21:28 EDT 2009, Artyom Shalkhakov wrote:
> Are there any libraries for "bidirectional" [1] programming
> in Haskell? Any related work?
Some of the early work in the PSD project (closely related
to the "lenses") were developed in Haskell,
http://www.iis.sinica.edu.tw/~scm/
Hi,
I believe this must have been raised before but I
did some searching to no avail, so please allow me..
It seems that verboseCheck is gone in QuickCheck 2.
In QuickCheck 2, how do we print the test cases,
specify the number of tests, or the sizes of test
cases, etc.?
Thank you very much..
s
‰t Augsburg, Germany
Carroll Morgan University of New South Wales, Australia
Shin-Cheng Mu Academia Sinica, Taiwan
Jose Nuno Oliveira Universidade do Minho, Portugal
Tim Sheard Portland State University, USA
Tarmo Uustalu Institute of Cybernetics Tallin,
of New York at Stony Brook,
USA)
Shin-Cheng Mu(Academia Sinica, Taiwan)
Henrik Nilsson (University of Nottingham, UK)
Michael Norrish (NICTA, Australia)
Jens Palsberg(University of California, Los Angeles, USA)
G. Ramalingam(Microsoft Research, India)
On 05/08/07, Frank Buss <[EMAIL PROTECTED]> wrote:
Is it possible to write functions with an arbitrary number of
arguments?
Would be nice if the average function would accept any number of pixel
values.
You may be interested to see Oleg Kiselyov's discussion on
polyvariadic functions in Haske
Thanks for the comments. I will take a look at the type
family extension.
The definition of plusFn proposed by Jim Apple worked
nicely. The solution from apfelmus works after fixing
a small typo:
newtype Equal a b = Proof (forall f . f a -> f b )
newtype Succ f a = InSucc { outSucc :: f (S a)
I am curious about the possibility of developing Haskell programs
spontaneously with proofs about their properties and have the
type checker verify the proofs for us, in a way one would do in
a dependently typed language.
In the exercise below, I tried to redo part of the merge-sort
example in Al
f
(ts, strm') ->
case idXsp strm' of
(us, strm'') -> (ts, us, strm'')
in (StartEvent a [] : ts ++ EndEvent a : us, strm'')
And I cannot quite explain why (Anyone?).
Is there a more structured solution? Ca
Dear Henning,
On May 19, 2006, at 6:16 PM, Henning Thielemann wrote:
On Fri, 19 May 2006, Shin-Cheng Mu wrote:
idX :: [XMLEvent] -> ([XMLEvent], [XMLEvent])
idX (StartEvent a : strm) =
let (ts, strm') = idX strm
(us, strm'') = idX strm'
i
ciate if someone could look into it. The actual program
is available at
http://www.psdlab.org/~scm/hx.tar.gz
It actually uses HXML, a library by Joe (Joe English?) to
do the parsing. The main program is hxpc.hs. There is a
1 MB sized sample input file size1m.xml. There are two
simple scripts &
14 matches
Mail list logo
