dvanhorn / redex-aam-tutorial
An Introduction to Redex with Abstracting Abstract Machines
☆102Updated last year
Alternatives and similar repositories for redex-aam-tutorial:
Users that are interested in redex-aam-tutorial are comparing it to the libraries listed below
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 9 years ago
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- A small implementation of type inference☆78Updated 9 years ago
- PeaCoq is a pretty Coq, isn't it?☆106Updated 3 years ago
- A formalization of category theory in the Coq proof assistant.☆95Updated 4 months ago
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆69Updated 9 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A library for effects in Coq.☆64Updated 2 years ago
- A pure Haskell implementation of Datalog☆104Updated 4 years ago
- TiML: A Functional Programming Language with Time Complexity☆77Updated 7 years ago
- ☆59Updated 5 years ago
- Link to preprints for POPL'17 and co-located events☆100Updated 8 years ago
- 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
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Logic for story telling!☆34Updated 7 years ago
- Link to preprints for ICFP'16 and co-located events☆139Updated 8 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆116Updated this week
- A SuperCompiler for Martin-Löf's Type Theory☆120Updated 3 years ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- A less devious proof assistant☆223Updated 2 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆129Updated this week
- Model finder for higher-order logic☆42Updated last year
- Emacs support for F*☆68Updated last month