Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Post History

81%
+7 −0
Q&A What does this function definition mean in Haskell?

fn x [] = [] means that if the second argument to fn is an empty list, return an empty list. fn x (True:ys) = x : fn x ys means that if the second argument to fn starts with True, return a list th...

posted 2y ago by r~~‭

Answer
#1: Initial revision by user avatar r~~‭ · 2022-11-22T17:33:10Z (about 2 years ago)
`fn x [] = []` means that if the second argument to `fn` is an empty list, return an empty list.

`fn x (True:ys) = x : fn x ys` means that if the second argument to `fn` starts with `True`, return a list that starts with the first argument to `fn` and continues with `fn x` applied to the remainder of the input list.

`fn x _ = []` means that if the second argument to `fn` is anything not covered by the previous cases, return an empty list. (This line means that the first line in the definition of `fn` is actually unnecessary.)

To synthesize, `fn x` takes a list and returns a list made of as many copies of `x` as there are consecutive `True` values at the start of the input list.