- San Francisco
- mattwestrik.com
Stars
- All languages
- Assembly
- BitBake
- C
- C#
- C++
- CMake
- CSS
- Clojure
- CoffeeScript
- Common Lisp
- Coq
- Dhall
- Elixir
- Elm
- Emacs Lisp
- Erlang
- G-code
- GLSL
- Gleam
- Go
- Go Template
- Groff
- HTML
- Handlebars
- Haskell
- Java
- JavaScript
- Jupyter Notebook
- KiCad Layout
- Kotlin
- LLVM
- Lean
- Lua
- Makefile
- Markdown
- Nix
- OCaml
- Objective-C
- OpenSCAD
- Perl
- Processing
- Prolog
- Python
- QML
- R
- Reason
- RenderScript
- Ruby
- Rust
- SCSS
- Scheme
- Shell
- Standard ML
- Swift
- SystemVerilog
- TLA
- TeX
- TypeScript
- VHDL
- Verilog
- Vim Script
- WebAssembly
- reStructuredText
3
stars
written in Standard ML
Clear filter
An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]
A small implementation of a proof refinement logic.