HexLibraryHexLibrary
</> HexCodeSign inSign up
PythonJavaScriptTypeScriptCC++JavaPHPGoRustRubyBashSQLLuaPerlCOBOLPascalDelphiFortranDartSwiftC#JuliaGroovyRElixirHaskellKotlinScalaClassic ASPClipperMS-DOS
LESSONS
Introduction to HaskellVariables (let)Data TypesOperatorsStringsListsConditions (if / then / else)Iteration (map / sum)Functions
REFERENCE
📖 Overview
🖥️ Output
📦 Value & Type
🔢 Numbers & Math
✍️ String
📚 List
head / !! / lengthmap / sum / [1..n]
🔀 Condition
🧩 Function
Haskell›REFERENCE›List›map / sum / [1..n]

map / sum / [1..n]

Transformation and aggregation (instead of loops).

Syntax

map f xs   //   sum xs   //   [1..n]

Description

There are no loops in Haskell. map transforms each element, sum adds them up. [1..n] is a range (inclusive of n). IO is applied to each element with mapM_.

Example

Loading editor…

Expected output

[1,4,9]
5050

When to use?

List processing: transforming, summing, filtering.

Related commands

head / !! / length
← head / !! / length
HexLibraryHexLibrary

Learn programming more clearly. Every command is explained line by line with colors, reinforced with runnable exercises, test your code instantly — all in one place, free.

Learn

  • Home
  • Languages & Lessons
  • HexCode

Company

  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

Other Projects

  • HexToolz
  • Free Service Manuals
© 2026 HexLibrary · The clearest way to learn code