Recent searches
Search options
#haskell
If anyone wants to learn #haskell I would recommend this online course from the University of Helsinki
Th exercises are particularly good - not too easy, not too difficult, but designed to get you to think in Haskell.
#Malware is harder to find when written in obscure languages • The Register
https://www.theregister.com/2025/03/29/malware_obscure_languages/
Introducing the Haskell Foundation Stability Working Group https://lobste.rs/s/2mpqub #haskell
https://blog.haskell.org/stability-working-group/
#haskell users: if you're using stack and you choose to switch your resolver to say, be compatible with HLS (Haskell Language Server), then be sure to run `stack clean`--this messed with me for a long time...
#haskell question about a course exercise
f x = (\y -> y) x
This is the identity function applies to the argument x. No problem here.
f x = \y -> y
I think this is invalid syntax. Lambda functions need to be wrapped in () ?
f x = (\y -> x) x
This one is unusual. I think it outputs x as if it were a constant. That is, the lambda function always outputs x, and doesn't calculate on y. Not sure about this one.....
Ⓥ
(he/him) Question for Haskell folks:
I have an odd issue with discrepancy between ghc and ghci behavior with respect to hmatrix (with everything installed via the system package manager on Debian sid+experimental). ghc works just fine, but within ghci, lapack throws an undefined symbol error for literally anything. Has anyone else run into this?
I am in urgent job search mode, so I'm gonna throw this out here and see if anything comes of it.
I am a #Canadian, fluent in both #English and #French. I have experience with several programming languages. My strongest proficiency is with #Haskell and #C. I also have a reasonable grasp of #HTML, #JavaScript, #SQL, #Python, #Lua, #Linux system administration, #bash scripting, #Perl, #AWK, some #Lisp (common, scheme, and emacs), and probably several others I've forgotten to mention.
I am not necessarily looking for something in tech. I just need something stable. I have done everything from software development, to customer support, to factory work, though my current circumstances make in-person work more difficult than remote work. I have been regarded as a hard worker in every job I have ever held.
Is there a way to define Hackage package candidates as a dependency for testing purposes in Stack or Cabal? #haskell
Here's my #Haskell library for making #gopher servers + tools for gopher menus.
https://hackage.haskell.org/package/Venusia-0.1.0.0/candidate
Readings shared March 26, 2025. https://jaalonso.github.io/vestigium/posts/2025/03/26-readings_shared_03-26-25 #AI #FunctionalProgramming #Haskell #ITP #IsabelleHOL #Logic #Math #Maxima
#haskell :: [a] -> Int -> [[a]]
Return a list of all combinations (i.e. order doesn't matter) of the given length.
CW your answers!
Example: Given "abc" and 2 the answer is ["ab","ac","bc"] but order doesn't matter at either level.
Level 2: Additionally, if the input is lexicographically sorted, so is the output.
Level 3: Additionally, typeclass constraints aren't allowed.
a #haskell exercise has me puzzled:
What is the C/Java/Python equivalent of the Haskell expression
send metric (double population + increase)?
---
A send(metric(double(population+increase)))
B send(metric(double(population)+increase))
C send(metric,double(population)+increase)
D send(metric,double(population+increase))
It isn't A or D because (double population + increase) is double(population) +...
answer is C but why can't it be B .. where metric is a function taking one argument?
#haskell beginner here.
Is there a "natural number" type so I can use Nat and not Int which is technically incorrect (based on a textbook example)
myrep :: Int -> b -> [b]
myrep 1 x = [x]
myrep n x = x : myrep (n - 1) x
just started learning #haskell
the exercise wants us to return undefined for divisor zero
divTuple :: (Eq a, Fractional a) => (a, a) -> a
divTuple (x, y)
| y == 0 = undefined
| otherwise = x / y
but when I run it, I seem to get an "crash" rather than a value of type undefined:
ghci> divTuple (4,0)
*** Exception: Prelude.undefined
CallStack (from HasCallStack):
undefined, called at 04-syntax-in-functions.hs:21:16 in main:Main
is this right?
Yikes!
This is a code example from
" Learn You a #Haskell for Great Good "
I realise it doesn't bother everyone, but it bothers me.
Let me expand that a bit. If the difference between (1) upsetting some readers, and (2) not upsetting some readers, is minuscule effort - why not go with the option that is inclusive?
I will file this away as 'from a different era".
