ISANobody / sillLinks
☆29Updated 10 years ago
Alternatives and similar repositories for sill
Users that are interested in sill are comparing it to the libraries listed below
Sorting:
- Generation of abstract binding trees☆27Updated 2 months ago
- Luck -- A Language for Property-Based Generators☆35Updated 9 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆21Updated 9 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 5 years ago
- Constructive Galois connections☆35Updated 7 years ago
- ☆62Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- The language of the future!☆72Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Miller/pattern unification in Agda☆67Updated last month
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆17Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Supporting tool for Gradual Typing☆16Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆49Updated 11 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago