ed
Clare Martin Oxford Brookes University
Andrey Mokhov Jane Street
Shin-Cheng Mu Academia Sinica
Nikolaos Papaspyrou National Technical University of Athens
Simon Peyton Jones Microsoft Research Cambridge
Norman Ramsey Tufts University
Exequiel Rivas INRIA
Tom Schrijvers (chair) KU Leuven
Martin Sul
ed
Clare Martin Oxford Brookes University
Andrey Mokhov Jane Street
Shin-Cheng Mu Academia Sinica
Nikolaos Papaspyrou National Technical University of Athens
Simon Peyton Jones Microsoft Research Cambridge
Norman Ramsey Tufts University
Exequiel Rivas INRIA
Tom Schrijvers (chair) KU Leuven
Martin Sul
PHD POSITION IN FUNCTIONAL PROGRAMMING AND PROGRAMMING LANGUAGE THEORY
(ref. BAP-2018-431)
The group of prof. Tom Schrijvers has expertise in a broad range of topics
related to functional programming and programming language theory,
including recent contributions to Haskell's type system an
theoretical foundations of programming languages
* constraint logic programming
For more details and application:
https://icts.kuleuven.be/apps/jobsite/vacatures/53891815?lang=en
For questions about the position, get in touch.
--
prof. dr. ir. Tom Schrijvers
Research Professor
KU Leuven
Prof. Tom Schrijvers invites applications for a postdoctoral position in
the area of functional, constraint and logic programming. The position
revolves around domain-specific languages (DSLs) embedded in Haskell for
constraint programming. It is part of the EU project GRACeFUL whose
overarching
!
--
prof. dr. ir. Tom Schrijvers
Research Professor
KU Leuven
Department of Computer Science
Celestijnenlaan 200A
3001 Leuven
Belgium
Phone: +32 16 327 830
http://people.cs.kuleuven.be/~tom.schrijvers/
___
Haskell mailing list
Haskell@haskell.org
http
You are kindly invited to the special edition of the Leuven Haskell User
Group with guest presentation by Amplidata.
For details see:
https://groups.google.com/d/msg/leuven-haskell/VNcTKtFPGL0/gQhPWtxTbg4J
--
prof. dr. ir. Tom Schrijvers
Research Professor
KU Leuven
Department of Computer
, 2015. Send your application (cover
letter, cv, 3 references) and any enquiries to tom.schrijv...@cs.kuleuven.be
.
--
prof. dr. ir. Tom Schrijvers
Research Professor
KU Leuven
Department of Computer Science
Celestijnenlaan 200A
3001 Leuven
Belgium
Phone: +32 16 327 830
http
domain-specific languages (DSLs) embedded in Haskell for constraint
programming. It is part of the EU project GRACeFUL whose overarching theme
is tools for collective decision making. The KU Leuven part of the project
is under the direction of prof. Tom Schrijvers.
To apply you must hold a recent
appointment of prof. Tom Schrijvers as research professor at KU Leuven.
The
position's aim is to reinforce the research activities in functional
programming, logic programming and/or programming language theory.
To apply you must hold a recent PhD (or be about to graduate) in one of the
above are
University Potsdam, Germany
Tom Schrijvers Ghent University, Belgium
Martin SulzmannHochschule Karlsruhe, Germany
Wouter Swierstra Universiteit Utrecht, The Netherlands
Tarmo Uustalu Institute of Cybernetics, Estonia
Janis Voigtlaender
University of Porto, Portugal
Torsten Schaub University Potsdam, Germany
Tom Schrijvers Ghent University, Belgium
Martin SulzmannHochschule Karlsruhe, Germany
Wouter Swierstra Universiteit Utrecht, The Netherlands
Tarmo Uustalu Institute of
Roma Tor Vergata, Italy
Enrico PontelliNew Mexico State University, USA
Kristoffer RoseIBM Research, USA
Sukyoung Ryu KAIST, South Korea
Vitor Santos Costa University of Porto, Portugal
Torsten Schaub University Potsdam, Germany
Tom
outh Wales, Australia
Simon Marlow, Microsoft Research, UK
Pablo Nogueira, Technical University of Madrid, Spain
Bruno Oliveira, Seoul National University, Korea
José Nuno Oliveira, University of Minho, Portugal
Rinus Plasmeijer, Radboud University Nijmegen, Netherlands
Tom Schrijvers, Ghent University, B
Plasmeijer, Radboud University Nijmegen, Netherlands
Tom Schrijvers, Ghent University, Belgium
Tim Sheard, Portland State University, US
Wouter Swierstra, University of Utrecht, Netherlands
Peter Thiemann, University of Freiburg, Germany
Simon Thompson, University of Kent, UK
Steve Zdancewic, Uni
Congratulations! I'm really looking forward to reading this.
Tom
On May 17, 2012 5:22 AM, "Simon Marlow" wrote:
> I'm delighted to announce that O'Reilly have agreed to publish a book on
> Parallel and Concurrent Haskell authored by me. The plan is to mak
contact me ASAP at tom.har...@cs.ox.ac.uk.
If you would like to come along, please register[2] your name to help
us get a more accurate estimate of the number of attendees.
Hope to see you there!
[1] http://sneezy.cs.nott.ac.uk/fun/
[2] http://goo.gl/ycPmp
--
Tom Harper
DPhil Student
Teaching
the link below.
Register here:
http://goo.gl/ycPmp
A handy map:
http://g.co/maps/f5zsb
More info:
http://sneezy.cs.nott.ac.uk/fun/
Hope to see you there!
--
Tom Harper
DPhil Student
Teaching Assistant
Department of Computer Science
University of Oxford
odels" under the direction of Tom Schrijvers.
The successful applicant has a master degree in Computer Science or
equivalent. Ideally, she/he will also have a strong, documented
interest in doing research. Strong problem-solving and programming
skills are essential. Prior knowledge of purely
user
interfaces, Internet applications, XML, databases, formal methods and model
checking.
The proceedings will be published as an LNCS volume. The proceedings
of the previous meeting (FLOPS 2010) were published as LNCS 6009.
PC co-Chairs
- Tom Schrijvers (Ghent
interfaces, Internet applications, XML, databases, formal methods and model
checking.
The proceedings will be published as an LNCS volume. The proceedings
of the previous meeting (FLOPS 2010) were published as LNCS 6009.
PC co-Chairs
- Tom Schrijvers (Ghent University, Belgium
Congratulations, Simons!
Tom
On 6/7/11, Isaac Potoczny-Jones wrote:
> I'm pleased to be able to relay the following announcement from ACM SIGPLAN:
>
> The SIGPLAN Programming Languages Software Award is awarded to an
> institution or individual(s) to recognize the devel
ld" == must?
Would this apply to everything on Hackage?
Thanks for clarifying,
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
btw- If you can move this thread.. please move it to the Haskell Cafe..
thanks :))
On Wed, May 26, 2010 at 6:35 PM, Tom Jordan wrote:
> Thanks for the info Yitz.. I'm psyched to dive in deep into Haskell, so the
> Haskell Cafe sounds best, although I'll probably sign up f
Thanks for the info Yitz.. I'm psyched to dive in deep into Haskell, so the
Haskell Cafe sounds best, although I'll probably sign up for both.. don't
want to miss out on anything !
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailm
structions are controlled from Haskell..
It seeming to be a great combination !
Thanks so much for the help, I'll be posting questions in the Haskell Cafe
from now on, but will still be monitoring this list.
Cheers,
Tom
On Wed, May 26, 2010 at 5:50 PM, Philip Weaver wrote:
> (in gmail
ert Oct (Oct_v 3) . Map.insert Mode (Mode_v 0) . Map.insert
Root (Root_v "2") $ Map.empty
main = print test
-- > fromList [(Root,Root_v "2"),(Oct,Oct_v 3),(Mode,Mode_v 0)]
Many Thanks,
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
tructor can update a previous value (if the Field has already
been added), or add-in a new entry if the Field hasn't been added yet.
Many Thanks,
Tom Jordan
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Mon, Apr 5, 2010 at 4:00 AM, Heinrich Apfelmus
wrote:
>> Does it scale? Absolutely, spec2code is not confined to
>> specifications for which optimized algorithms are already known.
>> spec2code can be used to implement operation systems, device drivers,
>> build systems, package management too
On Fri, Feb 19, 2010 at 5:39 PM, David Vollbracht
wrote:
> For any functional programmers in or around Atlanta, GA,
>
> The Atlanta Functional Programming Users Group is having its first Meeting!
That's great! We recently started a group here in Chicago; I'm
crossing my fingers that we'll end up
On Mon, Dec 7, 2009 at 11:25 AM, Deniz Dogan wrote:
> 2009/12/7 Don Stewart :
>> The Haskell Web News is a monthly summary of the hottest news about the
>> Haskell programming language, as found in our online communities. If you
>> want to catch up with what’s been happening in Haskell, this might
On Fri, Nov 27, 2009 at 9:30 PM, John Hughes wrote:
> This is a "heads up" about a workshop on test automation that I just joined
> the programme committee of. Automation of Software Test will be co-located
> with ICSE in Cape Town in May--the workshop home page is here:
>
> http://www.cs.alleghen
=> 2nd C1 inst
C2 Int y, C1 y
==> C2 FD improvement {Int/y} <<<<
C2 Int Int, C1 Int
==> C1 Int cycle detected
C2 Int Int
==> C2 1st instance
{}
It seems that you want improvement to happen at a higher priority than GHC
simulation regression
suites -- maybe QuickCheck in combination with a system modeling and
verification DSL.
If interested, send a resume.
Thanks!
-Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
try it, but GHC should run out of stack on this one or give up.
I'm currently working with Martin Sulzmann on a relaxed set of
conditions for FDs and type functions.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel:
tern lazy.
let ~(r',ts'') = ...
There's a recent thread on lazy patterns in the haskell-cafe list, too.
http://www.haskell.org//pipermail/haskell-cafe/2007-September/031974.html
Regards,
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Quoting Stefan O'Rear <[EMAIL PROTECTED]>:
On Mon, Sep 17, 2007 at 04:15:10PM +1200, Tom Pledger wrote:
Norman Ramsey wrote:
:
| This code fails to compile because the compiler is willing to
| use 'fold' at only one type (CmmExpr as it happens)
:
When it failed to c
If so, try working around the monomorphism restriction by changing
from a pattern binding to a function binding.
fold f = foldRegsUsed f
Regards,
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
.
gray edges: sequential composable rules
red edges: feedback arcs (bad)
blue edges: user defined scheduling constraints
- Bug fix affecting "alwayActiveWhenEnabled" performance constraint.
Enjoy!
http://www.funhdl.org/
-Tom
_
rg
http://www.haskell.org/mailman/listinfo/haskell
--
Tom Harper
Computer Science Major '07
Syracuse University
+1 949 235 0185
Public Key: http://aftereternity.co.uk/rth.asc
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
to the library.
Enjoy!
http://www.funhdl.org/
-Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
compilers use memoization? Is
there any way to guide automatic memoization?
Also, do any compilers use profiling data to enable or re-adjust
memoization caches of the worst offenders? In ECAD, we would call
this an in-place optimization (IPO).
-Tom
_
mbuco
* Martin Sulzmann, National University of Singapore
* Maurizio Gabbrielli, Universita di Bologna
* Thom Fruehwirth, Universitaet Ulm
* Tom Schrijvers, Katholieke Universiteit Leuven
Workshop Coordinators:
[EMAIL PROTECTED]
Tom Schrijvers (contact person)
De
tions?
Thanks for any help!
-Tom
SELECT * FROM freeKey;
SELECT * FROM nextKey;
INSERT INTO nextKey VALUES (1);
SELECT * FROM freeKey;
SELECT * FROM nextKey;
UPDATE nextKey SET key = 2 WHERE key = 1;
SELECT * FROM freeKey;
SELECT * FROM nextKey;
UPDATE nextKey SET key = 3 WHERE key = 2;
INSERT
ented at the moment but that's something I hope to fix
soon.
Thanks
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
once
your yum.conf file is suitably configured.)
As an example, to install GHC, the GHC profiling libraries, and the GHC
docs, you could use the following command:
yum install ghc ghc-prof ghc-docs
To see what packages are available, use this command:
yum list '*' | grep haskel
nterfaceNode (annots, bo ,tp) (c,t,i)) =
t
in
map (g) nodes
The idea is that the every node in the graph is
visited only once, moreover that the function "h" is computed only once for
every nod
The darwin ports version appears not to be too happy just now...
Error: Target com.apple.build returned: shell command "cd
"/Users/tatd2/darwinports/dports/lang/ghc/work/ghc-6.2.2" && make all"
returned error 2
Command output: In the definition of `remInteger':
remInt
A.J. Bonnema wrote:
If I use isSpace from the hugs interpretor, it works.
If I use isSpace from a test.hs file I get the error message:
Undefined variable "isSpace"
From ghc I get the error message:
Variable not in scope: "isSpace"
What is wrong?
Hugs automatically imports a few extra things as w
sing the -I, -P or -package options with the absolute
path of IOExts module. All of the options don't fix the
problem.
Does any one know how I can hmake tell where it can
find the IOExts module.??
Thanks in advance,
Tom Hofte
___
Haskell
Hi,
I want to use the memo function for implementing a dynamic programming algorithm in Haskell.
This is needed to cache intermediate results.
Can anyone tell me where I can find some examples that use the memo function or even a tutorial.
Thanks,
Tom HofteMSN Search, for accurate results
be:
do nnRef <- newSTRef (NN { ... }) -- set the initial NeuralNet state
--from here on, you pass nnRef around as a parameter
Control.Monad.State (as opposed to ST) may be a closer match for the NNO
and NNT types.
Regards,
Tom
___
Haske
is in
Haskell?
Kind regards,
Tom Hofte
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ogeneous list of class instances' problem goes away.
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
[EMAIL PROTECTED] wrote:
Tom,
Then what will you do when naming operations in a class? Is it right that
care has to be taken in order not to conflict with other classes?
Say, I have a Person class where I want to define an operation "getName".
Is it wise to name it "getPersonName&
Illumination
import Weight
easyToCarry = (Illumination.Light, Weight.Light)
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi,
I have an question about the IO monad
I want to have a function that unpack an
IO.
I should have the type: IO a -> a.
Is this possible?
Kind regards
Tom Hofte
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mail
WrapsError :: Either String ((), String)
writerWrapsError = runWriterT test
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
tion was
magnitude v = v(.x, .y) <| sqrt (x*x + y*y)
which was quite similar to Cayenne's "open ... use ... in ..." feature.
Regards,
Tom Pledger
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
))
data Auction = Auction (IORef (Seller, Title, Description, [Bid]))
data User= User(IORef (UserId, Name, [Auction], [Bid]))
to get the edge traversal down to O(1).
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/m
en n is not in Foo:
class Foo n
data Foo n => Erk n = Erk
test = case Erk :: Erk () of-- () is not an instance of Foo
Erk -> "Unrestricted!"
See John Hughes's paper "Restricted Datatypes in Haskell&q
x a c, min b d) +
case compare b d of
LT -> intersectionSize s1' s2
EQ -> intersectionSize s1' s2'
GT -> intersectionSize s1 s2'
intersectionSize _ _ = 0
So... how *compressible* are your data?
- Tom
[EMAIL PROTECTED] writes:
| G'day all.
|
| Tom Pledger wrote:
|
| > How about adapting splay trees so that their pointers become weak
| > after a certain depth? The advantage for caching is that the more
| > frequently used elements move closer to the root, so you wouldn&
loser to the root, so you wouldn't have
to add much code for tracking recent use, just a depth threshold.
See the book Purely Functional Data Structures for more details on
implementing splay trees in a functional setting.
- Tom
___
Haskell ma
well, I'll look into
contributing it to a Haskell implementation. (O'Hugs may well be the
best fit.)
- Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
sed Haskell to write PXSL because (a) I like Haskell, (b) it made
writing the parser easy (thanks, Parsec!), (c) it made the macro system
easy, and (d) did I mention that I like Haskell?
Cheers,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
s approach supports some neat tricks
http://www.willamette.edu/~fruehr/haskell/evolution.html#fundep
which the prioritised approach probably wouldn't.
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
which is clearer if you use 'non-pointfree' notation
...
c2 f g x y = f (g x y)
c1 f g x = f (g x)
c0 f g = f g
- Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
tate (fmapM (\a -> modify (a:)) fa) [])
The question was "Suppose I have a tree of some values that supports
fmap, is there any way I can use the fmap function to collect a list
of all the node values?"
A: Yes, use something like fseq2list, provided that you first declare
your tree t
classifyBy eq xs | eq <- eqs]
>
> fsteq x y = fst x == fst y
> sndeq x y = snd x == snd y
>
> test = classifyBys [fsteq, sndeq] [(1, '0'), (1, '2'), (2, '0')]
In practice, you'd probably want an Ord-lik
the precision of the
arguments. This gets into trouble when there are no arguments: pi
would presumably have to have fixed precision. Although you could
always ignore it in favour of something like
(4 `withBits` 300) * atan (1 `withBits` 300)
Regards,
Tom
http://h
mInteger m * fromInteger b ^ n, 0)
| otherwise = (fromInteger w, encodeFloat r n)
where (m,n) = decodeFloat x
b = floatRadix x
(w,r) = quotRem m (b^(-n))
HTH.
Tom
__
I've replied to this in haskell-cafe.
Alexandre Weffort Thenorio writes:
:
| But I get this error saying:
|
| Expected Type: [String]
| Inferred Type: String
:
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/has
> data State = forall a . Term a => State a
- Don't use monadic state at all, but instead pass the state around
explicitly.
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Dean Herington writes:
:
| My question came up in the context of describing such an abstract type for
| users of the type. Like many others, I like to include actual Haskell
| code where appropriate in the documentation. It didn't seem right to
| commit there to either `data` or `newtype`.
Main> take 5 (nco (pi/2))
[1.0 :+ 0.0,
cis
(-4.37114e-08) :+ 1.0,(-1.0) :+ (-8.74228e-08),1.31134e-07 :+
(-1.0),1.0 :+ 1.74846e-07]
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
A third way is to put each datatype declaration in a separate module and
use qualified imports.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Cai john writes:
:
| what I want to do is eliminate b,c & d into a
| recursive function:
|
| insertList tree [] = Empty
| insertList tree (x:xs) = insertList(insert tree x)
|
| but hugs is complaining about a top-level overloading
| error.Any idea how to fix it, thanks.
I don't see
Nick Name writes:
:
| Ok I can't resist longer. It's ages I have been wondering what's a
| catamorphism, and an anamorphism, and what the hell does it mean
| "data is expressed by destructors and not by constructors", but I
| have had no time till now. Please some of you all catamorphism
| ex
,t') <- iterateUntilConverged (doThingOne dm) (doThingTwo dm) t
getResults dm as t'
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Mark Fielder writes:
| How does Haskell provide encapsulation? What mechanisms does it
| use?
The ways that spring to mind are modules and nested declarations:
http://haskell.cs.yale.edu/onlinereport/modules.html
http://haskell.cs.yale.edu/onlinereport/decls.html#sect4.4
| What are
infixr 1 *==
(a *== f) applyToOtherAs = f (($a) . applyToOtherAs)
test f2 = 5 *== 6 *== ($f2) $ id
-- test (,) --> (5,6)
-- :t (*==) --> left as a strenuous exercise for the reader
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
knob.
2. A small lump.
3. The essence; the core: the nub of a story
I think essence is the right meaning, removing all duplicates.
Cheers,
--
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
???ithout
> saying it explicitly in the prompt)
>
> What s being the problem here?? Am I overlooking something here?
> If you can help me... don't hesitate to contact me
>
> Thx,
>
> a haskell-lover
This appears to be a question based on the exam of our declara
Andre W B Furtado writes:
| I was visiting http://www.ai.mit.edu/extra/icfp-contest/ and noticed that
| there was a functional programming contest in ICFP 98. I'd like to know if
| there are any periodic functional progamming contests around the world, such
| as the ACM contest for the C langu
change to your .emacs file will cause Haskell Mode to use GHCi instead.
You can find the RPMs here:
http://www.moertel.com/~thor/emacs-haskell-mode/
Cheers,
Tom
P.S. I have also made the RPM .spec file available. If somebody can
add it to the official haskell-mode tarball on haskell.org
stions?
update mt newValue = mt {x = newValue}
HTH.
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ted.
Try typing [1..10] at the Hugs prompt instead.
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
David Feuer writes:
:
| Question: Is there any standard way in Haskell of determining the
| maximal and minimal Int values?
Yes, instance Bounded Int, which means you can use
maxBound :: Int
and
minBound :: Int
___
Haskell mailing list
[E
h it wasn't intended? Should I
write application-specific versions of FiniteMap for particular uses?
Or is there an industrial-strength FiniteMap that I can rely on for
all purposes?
Thanks in advance for any hints, tips, and wisdom that you can share.
Cheers,
Tom
Andre W B Furtado writes:
| Roughly speaking, I'm in need of a monad (say MyIO) that interprets the
| following code
|
| >f :: MyIO ()
| >f = do
| >action1
| >action2
| >action3
| >...
| >return ()
|
|
| as applying action1 to g, then action2
rsable g) => Traversable (BC f g) where ...
Also see http://www.cse.ogi.edu/~mpj/pubs/springschool.html
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
site.
Cheers,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
necessary for making Close
Integer an instance of Integral.
- Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Andre W B Furtado writes:
:
| copyFile :: String -> String -> IO String
| copyFile [] s = return (reverse s)
| copyFile (a:as) s = copyFile as ( (doSomeStuffWith a):s)
:
| For example, suppose function doSomeStuffWith returns its own
| parameter. Using a 1.5MB file in this case, the Haskel
ed as *->* (unary type constructor)
class Eq a where
(==), (/=) :: a -> a -> Bool
-- Here a's kind is inferred as * (nullary type constructor, or type)
Here's a previous thread about kind inference, if you're interested.
http://haskell.cs.yale.edu
explicitly named types with add-a-field subtyping and remove-a-summand
subtyping? For that matter, is it how O'Hugs already works beneath
the surface?
Regards,
Tom
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
implications
for any future language extensions?
- How does it relate to the alternative record mechanism idea you
mentioned a while ago?
http://haskell.org/pipermail/haskell/2000-December/000213.html
Regards,
Tom
___
Has
Thanks for the replies. I keep forgetting to read (!!1) as "the
element at 1" and not as "the 1st element".
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Just as a matter of idle curiosity, is there a particular reason for
tuples starting at element 1 (fst) whereas lists start at element 0?
fst ('x', 'y') --> 'x'
"xy" !! 1 --> 'y'
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskel
1 - 100 of 171 matches
Mail list logo
