- Pennsylvania, Gensokyo
-
14:14
(UTC -05:00) - https://ice1000.org
Highlights
- Pro
Lists (4)
Sort Name ascending (A-Z)
Stars
- All languages
- Agda
- Arduino
- Batchfile
- C
- C#
- C++
- CMake
- CSS
- Clojure
- CoffeeScript
- Common Lisp
- Coq
- Crystal
- Dart
- Dhall
- Elixir
- Emacs Lisp
- F#
- F*
- Fortran
- Frege
- GDScript
- Go
- Groovy
- HTML
- Haskell
- Idris
- Java
- JavaScript
- JetBrains MPS
- Julia
- Jupyter Notebook
- Koka
- Kotlin
- LLVM
- Lean
- Lua
- Makefile
- Nix
- OCaml
- PHP
- Perl
- PowerShell
- Python
- Racket
- Raku
- ReScript
- Red
- Ren'Py
- Rocq Prover
- Ruby
- Rust
- SCSS
- SMT
- Scala
- Scheme
- Shell
- Standard ML
- Swift
- TeX
- TypeScript
- Typst
- Vala
- Verilog
- Vim Script
- Visual Basic
- Vue
- Yacc
- Zig
A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
Logical manifestations of topological concepts, and other things, via the univalent point of view.
Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT
Agda formalisation of the Introduction to Homotopy Type Theory
A formalized proof of a version of the initiality conjecture
An attempt towards univalent classical mathematics in Cubical Agda.
Normalization by evaluation of simply typed combinators.
Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.
A formalization of the theory behind the mugen library
Meta-theory and normalization for Fitch-style modal lambda calculi
Simply-typed lambda calculus as a QIT in cubical Agda + normalization
Agda formalisation of FOTC (First-Order Theory of Combinators).