Recursive insert sort in JavaScript written in Prolog style

recursivePrologStyleInsertSort.js

const allowedSortValueTypes = ['string', 'number', 'bigint'];

const usePrologStyleList = (array) => {
  const [head, ...tail] = array;
  return [head, tail];
};

const insertState = (value, list, acc, isInserted) => {
  const [head, tail] = usePrologStyleList(list);

  if (!allowedSortValueTypes.includes(typeof value)) {
    throw new Error(`Value must be one of: ${allowedSortValueTypes.join(', ')}. Given: ${typeof value}`);
  }

  if (head === undefined) {
    return [...acc].concat(isInserted ? [] : value);
  }

  if (value > head || (value <= head && isInserted)) {
    acc = acc.concat(head);
  } else if (value <= head && !isInserted) {
    acc = acc.concat(value, head);
    isInserted = true;
  }

  return insertState(value, tail, acc, isInserted);
};

const insert = (value, list) => insertState(value, list, [], false);

const insertSortState = (list, sortedList, acc) => {
  const [head, tail] = usePrologStyleList(list);

  if (head === undefined) {
    return sortedList = acc;
  }

  return insertSortState(tail, sortedList, insert(head, acc));
};

const insertSort = (list) => insertSortState(list, [], []);

This script is based on this Prolog program.

Use case:

const sortedList = insertSort([1, 5, 3, 2, 4]);
console.log(sortedList);

Result:

[ 1, 2, 3, 4, 5 ]