kvalle / sml-testingLinks
Simple framework for testing Standard ML code.
☆23Updated 12 years ago
Alternatives and similar repositories for sml-testing
Users that are interested in sml-testing are comparing it to the libraries listed below
Sorting:
- Dafny for Metatheory of Programming Languages☆26Updated 2 weeks ago
- Polynomial semantics of linear logic☆13Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- ☆42Updated 6 years ago
- Exploration of primes, factorization and number theory through haskell☆10Updated 8 years ago
- Haskell's Core in K.☆20Updated 8 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆44Updated last year
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 7 years ago
- ☆21Updated 7 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 4 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Updated 6 years ago
- A discouraging story.☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- ☆17Updated 6 years ago