ISANobody / sillLinks
☆29Updated 9 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 10 months ago
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- ☆22Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Higher-order FRP compiler☆15Updated 3 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago