Soonad / Formality-Net-AnimatorLinks
Animations for Elementary-Affine-Net interactions
☆11Updated 6 years ago
Alternatives and similar repositories for Formality-Net-Animator
Users that are interested in Formality-Net-Animator are comparing it to the libraries listed below
Sorting:
- Minimal, efficient proof language☆14Updated 6 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Superposition prover☆17Updated 2 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- sorear's Metamath system engine - version 3 Rust☆24Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- Blockchain Technology for the Working Mathematician☆24Updated 8 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A WebAssembly implementation in Lean4☆34Updated last year
- An implementation of the Formality language in C☆13Updated 5 years ago
- Base Formality libraries☆9Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- An LLVM interface for Lean 4. (WIP)☆21Updated last year
- ☆35Updated 6 years ago
- ☆13Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- An extended typed Lambda Calculus☆21Updated 11 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Tool for compiling Lean to WASM☆19Updated last year
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- ☆16Updated 7 years ago
- Thoughts and stuff☆70Updated 5 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago