diff --git a/docs/function-table-stable-sort.md b/docs/function-table-stablesort.md
similarity index 99%
rename from docs/function-table-stable-sort.md
rename to docs/function-table-stablesort.md
index 8462f74..908bb4d 100644
--- a/docs/function-table-stable-sort.md
+++ b/docs/function-table-stablesort.md
@@ -21,7 +21,7 @@ The best stable sorting algorithms I know of are Python's [timsort](https://en.w
 
 The proposed API would be:
 
-`table.stable_sort <V>: (t: {V}, lt: ((V, V) -> boolean)?, reverse: boolean?) -> ()`
+`table.stablesort <V>: (t: {V}, lt: ((V, V) -> boolean)?, reverse: boolean?) -> ()`
 
 (Or alternatively, this could replace `table.sort` but be behind a feature flag.)