# \#erlang

**URL:** https://discourse.julialang.org/tag/erlang/867.md

[Latest](https://discourse.julialang.org/latest.md) · [Categories](https://discourse.julialang.org/categories.md) · [Tags](https://discourse.julialang.org/tags.md)

---

## [All permutations example in Erlang](https://discourse.julialang.org/t/all-permutations-example-in-erlang/71380)

<div class="topic-metadata">

**Author:** [@Bardo](https://discourse.julialang.org/u/Bardo)\
**Replies:** 4\
**Last updated:** [November 12, 2021, 2:37pm UTC](https://discourse.julialang.org/t/all-permutations-example-in-erlang/71380 "2021-11-12T14:37:20Z")

</div>

Wondering how this compact Erlang code perms(\[\]) -\> \[\[\]\]; perms(L) -\> \[\[H|T\] || H \<- L, T \<- perms(L--\[H\])\]. could look in Julia language. Common Lisp apparently uses the same logic, but is more verbose: (defun per…