Update README

Signed-off-by: Stefan Marr <[email protected]>

Author: smarr

README.md

@@ -1,31 +1,31 @@
 Are We Fast Yet? Comparing Language Implementations with Objects, Closures, Arrays, and Strings
 ===================================================================================================
 
-[![Build Status](https://travis-ci.org/smarr/are-we-fast-yet.svg?branch=master)](https://travis-ci.org/smarr/are-we-fast-yet)
+[![Build Status](https://github.com/smarr/are-we-fast-yet/actions/workflows/ci.yml/badge.svg)](https://github.com/smarr/are-we-fast-yet/actions/workflows/ci.yml)
 
 ## Goal
 
 The goal of this project is to assess whether a language implementation is
-highly optimizing and thus is able to remove the overhead of programming
-abstractions and frameworks. We are interested in comparing language
-implementations with each other and optimize their compilers as well as the
+*highly optimizing* and thus able to remove the overhead of programming
+abstractions and frameworks. We are interested in *comparing language
+implementations* (not _languages_!) with each other and optimize their compilers as well as the
 run-time representation of objects, closures, arrays, and strings.
 
 This is in contrast to other projects such as the [Computer Language Benchmark
 game][CLBG], which encourage finding the
 smartest possible way to express a problem in a language to achieve best
-performance.
+performance, an equally interesting but different problem.
 
-##### Approach
+#### Approach
 
 To allow us to compare the degree of optimization done by the implementations
 as well as the absolute performance achieved, we set the following basic rules:
 
-  1. The benchmark is 'identical' for all languages.  
+  1. The benchmark is 'identical' for all languages.
      This is achieved by relying only on a widely available and commonly used
      subset of language features and data types.
 
-  2. The benchmarks should use language 'idiomatically'.  
+  2. The benchmarks should use language 'idiomatically'.
      This means, they should be realized as much as possible with idiomatic
      code in each language, while relying only on the core set of abstractions.
 
@@ -34,7 +34,7 @@ For a description of the set of common language abstractions see [the *core*
 language](docs/core-language.md) document.
 
 The initial publication describing the project is [Cross-Language Compiler
-Benchmarking: Are We Fast Yet?][3] and can be cited as follows:
+Benchmarking: Are We Fast Yet?][3] and can be cited as ([bib file][28]):
 
   > Stefan Marr, Benoit Daloze, Hanspeter Mössenböck. 2016.
   > [Cross-Language Compiler Benchmarking: Are We Fast Yet?][4]
@@ -221,7 +221,7 @@ benchmarks.
 
 - [Simple Object Machine Implementation in a Functional Programming Language][20]  
   Filip Říha. Bachelor's Thesis, CTU Prague, 2023.
-  
+
 - [Supporting multi-scope and multi-level compilation in a
    meta-tracing just-in-time compiler][23]  
   Y. Izawa. PhD Dissertation. Tokyo Institute of Technology, 2023.
@@ -326,6 +326,7 @@ benchmarks.
  [25]: https://stefan-marr.de/downloads/acmsac23-huang-et-al-optimizing-the-order-of-bytecode-handlers-in-interpreters-using-a-genetic-algorithm.pdf
  [26]: https://drops.dagstuhl.de/opus/volltexte/2019/10796/pdf/LIPIcs-ECOOP-2019-4.pdf
  [27]: http://www.jot.fm/issues/issue_2022_02/article2.pdf
+ [28]: https://github.com/smarr/are-we-fast-yet/blob/master/CITATION.bib
 
  [CD]:        https://www.cs.purdue.edu/sss/projects/cdx/
  [CDjs]:      https://github.com/WebKit/webkit/tree/master/PerformanceTests/JetStream/cdjs