HIPERFIT / contractsLinks
Symbolic financial contract EDSL
☆39Updated 5 years ago
Alternatives and similar repositories for contracts
Users that are interested in contracts are comparing it to the libraries listed below
Sorting:
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- ☆84Updated 8 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Miller/pattern unification in Agda☆67Updated last week
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Homotopy theory in Coq.☆89Updated 14 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- A hip inductive theorem prover!☆90Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Beautiful, interactive visualizations of logical inference☆149Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated 2 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A very simple coq layer for spacemacs☆37Updated 6 years ago
- Homotopy Type Theory proofs in Idris☆22Updated 6 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Lean Tutorials☆46Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"☆23Updated 13 years ago
- Formal topology (and some probability) in Coq☆31Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago