-
PLCT | Rustica
- Complex Manifold
-
21:45
(UTC +08:00) - caimeo.space
- https://sr.ht/~caimeo
- https://www.codewars.com/users/CAIMEO
Highlights
Lists (13)
Sort Name ascending (A-Z)
- All languages
- ANTLR
- APL
- Ada
- Agda
- Assembly
- BQN
- Batchfile
- Brainfuck
- C
- C#
- C++
- CMake
- CSS
- Chapel
- Clojure
- Common Lisp
- Coq
- Crystal
- Cuda
- Dart
- Dhall
- Dockerfile
- Earthly
- Elixir
- Elm
- Emacs Lisp
- Erlang
- F#
- F*
- Factor
- Flix
- Frege
- GAP
- GLSL
- Game Maker Language
- Go
- HTML
- Hack
- Haskell
- Haxe
- Idris
- JSON
- Java
- JavaScript
- JetBrains MPS
- Julia
- Jupyter Notebook
- Koka
- Kotlin
- LLVM
- Lean
- Linear Programming
- Lua
- MDX
- MLIR
- Macaulay2
- Makefile
- Markdown
- Mathematica
- Mercury
- Mojo
- MoonBit
- Nearley
- Nim
- Nix
- OCaml
- Objective-C
- Odin
- PHP
- Perl
- PostScript
- PowerShell
- Prolog
- PureScript
- Python
- Q#
- QML
- Racket
- ReScript
- Reason
- RenderScript
- Rich Text Format
- Rocq Prover
- Ruby
- Rust
- SMT
- Sail
- Scala
- Scheme
- Shell
- Shen
- Solidity
- Spline Font Database
- Standard ML
- Svelte
- Swift
- TeX
- TypeScript
- Typst
- V
- Vala
- Verilog
- Vim Script
- Vue
- WebAssembly
- XSLT
- YARA
- Zig
Starred repositories
The CompCert formally-verified C compiler
Add a stalin sort algorithm in any language you like ❣️ if you like give us a ⭐️
Formal verification tool for Rust: check 100% of execution cases of your programs to make safe applications for demanding domains.
This rocq library aims to formalize a substantial body of mathematics using the univalent point of view.
An axiom-free formalization of category theory in Coq for personal study and practical work
Metaprogramming, verified meta-theory and implementation of Rocq in Rocq
A work-in-progress language and compiler for verified low-level programming
Mathematical Components compliant Analysis Library
A formalization of geometry in Coq based on Tarski's axiom system
High level commands to declare a hierarchy based on packed classes
Replib: generic programming & Unbound: generic treatment of binders
A verified polyhedral scheduling validator in Coq.
HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)
vellvm / ticl
Forked from vellvm/ctreesLibrary for structural temporal logic proofs over coinductive, free monads with effects and choice.