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:
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Dafny for Metatheory of Programming Languages☆26Updated 2 months ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- ☆29Updated 10 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 8 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Programs that are used in the Cousineau/Mauny books☆31Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆21Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 3 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- ☆21Updated 7 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Foundational Verification of Hybrid Systems☆15Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year