Very cool! The examples on this page are Scheme implementations of the Examples section of his 2003 paper[0] linked on the page. He goes over the derivation of the programs for these examples in more detail in the paper.
Interesting resource. Given that "no-cloning" [1] seems to be a fundamental property of quantum mechanics, I would expect any relevant programming language to enforce linear types i.e. "use exactly once" constraint.
The calculus turns out to be closely related to the linear lambda calculi used in the study of Linear Logic. We set up a computational model and an equational proof system for this calculus, and we argue that it is equivalent to the quantum Turing machine.
That survey was written over 10 years ago. The field of quantum computation has grown by leaps and bounds since then. Modern quantum programming languages like pyQuil [0], Qiskit [1], and Q# [2] are designed to address the progress of quantum computing; like the fact that we now have small devices with 10s of qubits.
There is an abundance of tools for reasearchers now, each with specific purposes. Libraries such as libquantum have different uses to libraries such as qiskit.
[0]: https://arxiv.org/pdf/quant-ph/0307150.pdf