Programming languages

Languages

• Effekt
• Elixir
• Elm
• Expresso
• Flix
• Gluon
• IntercalScript
  • Case objects are similar to polymorphic variants in OCaml.
• Koka
• Lean 4
• Lobster
• Lua
• Nim
  • Its garbage collection with deferred reference counting is interesting.
• OCaml
• Scala
• Swift
• Uiua
• Unison
• Yatima

Go

• Go
  • The package namespace system like Go works only with object-oriented programming as classes create sub-namespaces.
• Channels - A Tour of Go
• DQNEO/babygo

Haskell

• Glasgow Haskell Compiler
• The Spineless Tagless G-machine

Python

• CPython
• PyPy
• Cinder
• Mojo

Scheme

• R7RS
• Racket
• scheme.org
• SRFI

TypeScript

• TypeScript
• Deno

Ruby

• CRuby
• Parallel and Thread-Safe Ruby at High-Speed with TruffleRuby

Rust

• Guide to Rustc Development
• Reading Arc in Rust (Japanese)

Technologies and concepts

Language design

• Less is more: language features
• プログラミング言語の未来はどうなるか
• Robert Virding - On Language Design (Lambda Days 2016)
• The Rise of “Worse is better”
• Design Criteria for Programming Languages
• Go at Google: Language Design in the Service of Software Engineering
• Language Design

Type system

• Lecture slides of recursive types at Cornell University
• Algebraic subtyping
  • Polymorphism, Subtyping, and Type Inference in MLsub
• Practical type inference for arbitrary-rank types
• Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism

Effect system

• Effects bibliography
• libhandler

Garbage collection

• ラピッドイテレーションを実現するRE ENGINEの設計

Reference counting

• Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming
  • Slides
• Perceus: Garbage Free Reference Counting with Reuse
• Reference Counting with Frame Limited Reuse

Immix GC

• mu/immix-rust
• Immix: A Mark-Region Garbage Collector with Space Efficiency, Fast Collection, and Mutator Performance
• Taking Off the Gloves with Reference Counting Immix
• Rust as a Language for High Performance GC Implementation

Algorithms and data structures

• Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections
• LazyList | Scala
• Foreign Function Interface | Deno

RRB tree

• RRB-Trees: Efficient Immutable Vectors
  • elm-array
• Improving RRB-Tree Performance through Transience
  • c-rrb
  • The blog post
  • arazabishov/pvec-rs
  • Other implementations and descriptions of RRB trees | Closure core library

Coroutine

• From folklore to fact: comparing implementations of stacks and continuations
• Coroutines for Go
• Stackful coroutine実装まとめ
• Coroutine | Boost

Lossless syntax tree

• Persistence, facades and Roslyn’s red-green trees
• Lossless Syntax Tree Pattern | Oil

WASM

• Emscripten
• Wasmtime
• Cranelift
  • Cranelift IR
• bytecodealliance/wasi
• microsoft/mimalloc
• bytecodealliance/wasm-micro-runtime

Concurrency and parallelism

• Keynote: Announcing Broadway - ElixirConf EU 2019
  • Basic back pressure can be implemented as queue limits.
• dashbitco/broadway
• Akka Stream
• Runtime Support for Multicore Haskell

Books

• プログラマーのためのCPU入門 ― CPUは如何にしてソフトウェアを高速に実行するか
• Language Server Protocol の仕様 及び実装方法

References

• ChessMax/awesome-programming-languages
• learn-anything/programming-languages
• Kixiron/rust-langdev