Lists (2)
Sort Name ascending (A-Z)
Stars
- All languages
- APL
- ATS
- Agda
- Assembly
- C
- C#
- C++
- CSS
- Chapel
- Clojure
- Common Lisp
- Coq
- Cuda
- Dhall
- Elm
- Emacs Lisp
- Erlang
- F*
- Flix
- Frege
- Futhark
- Go
- HTML
- Hack
- Haskell
- Idris
- Java
- JavaScript
- Julia
- Koka
- Kotlin
- LLVM
- Lean
- Makefile
- Markdown
- Mercury
- Nix
- OCaml
- PHP
- Perl
- Prolog
- PureScript
- Python
- Racket
- ReScript
- Reason
- Rocq Prover
- Roff
- Ruby
- Rust
- SCSS
- SMT
- SWIG
- Scala
- Scheme
- Shell
- Standard ML
- Swift
- SystemVerilog
- TLA
- TeX
- TypeScript
- Verilog
- Vim Script
- Wren
- Zig
- q
8
stars
written in HTML
Clear filter
🎓 Path to a free self-taught education in Computer Science!
This book will be a textbook written in the univalent style, taking advantage of the presence of symmetry in the logic at an early stage.
Benchmarks for capture-avoiding substitution
PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
sweirich / lennart-lambda
Forked from steshaw/lennart-lambdaλλλλ Lennart Augustsson's λ-calculus cooked four ways
A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.