Document Type
Technical Report
Publication Date
5-23-2025
Pages
1-4
Abstract
This work in progress aims to compare various HOT (higher-order and statically typed, a term coined by Phil Wadler) through reproducible course-grained, wall-time benchmarks. Our overall goals include simplicity, agility, and reproducibility.
There is currently only one benchmark, but it brings out substantial performance differences among the various languages and platforms. It uses function composition and other higher-order constructs to build a pipeline of transformations, along with a brute-force iteration that is computationally expensive for input files specifying large ranges as function domains. We currently include versions in Modern C++, C#, Go, Haskell, Kotlin, Modern (stream-based) Java (24), OCaml, Scala 3, and Swift.
It is easy to add versions of this benchmark in other languages not yet covered, and we plan to make it easy to add other algorithms to be benchmarked across languages.
Recommended Citation
Laufer, Konstantin. HOTLangBench, a Tiny Benchmark Suite for Higher-Order Statically Typed Languages. , , : 1-4, 2025. Retrieved from Loyola eCommons, Computer Science: Faculty Publications and Other Works, http://dx.doi.org/10.6084/m9.figshare.29134013.v8
Creative Commons License
This work is licensed under a Creative Commons Attribution-Share Alike 4.0 International License.
Copyright Statement
© The Author(s), 2025.
Dataset
Comments
Author Posting © The Author(s), 2025. This is a work in progress. The article and dataset are available at https://doi.org/10.6084/m9.figshare.29134013.v8.