Difference between revisions of "Benchmarking"
Jump to navigation
Jump to search
| Line 44: | Line 44: | ||
= Summary = | = Summary = | ||
| + | |||
| + | == Benchmark Coverage == | ||
| + | How structured combinators are distributed over benchmark applications, so far? The following image illustrates the occurrence of each combinator type (1 - 64) over a few programs. SK-combinators are shown separately, as a way to compare with traditional abstraction algorithms. | ||
| + | |||
| + | [[File:Coverage.png |300px|frameless|Combinator types over benchmark applications]] | ||
Revision as of 06:38, 8 August 2022
Programs
From nofib
- Sorting
- exp3_8
- digits-of-e
- tak
- nfib
- queens
- x2n1
- primes
- Awards
- Boyer
- Clausify
- Knights
- Cichelli
- SCC
- GCD
- Calendar
- RSA
- lcss
- n-body
- binary-trees
- pidigits
From the Reduceron
Other
Synthetic
- planned
Summary
Benchmark Coverage
How structured combinators are distributed over benchmark applications, so far? The following image illustrates the occurrence of each combinator type (1 - 64) over a few programs. SK-combinators are shown separately, as a way to compare with traditional abstraction algorithms.
