A small compiler for PCF
☆127Oct 26, 2020Updated 5 years ago
Alternatives and similar repositories for pcf
Users that are interested in pcf are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Calculus of Constructions☆18Jul 17, 2019Updated 6 years ago
- A small implementation of type inference☆80May 19, 2015Updated 10 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Feb 9, 2016Updated 10 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆69Oct 16, 2023Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Feb 5, 2020Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A Brainfuck interpreter written in Agda☆53Aug 9, 2021Updated 4 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆102Jun 8, 2022Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆45Mar 1, 2026Updated 3 weeks ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- An experimental intermediate language for GHC☆36Sep 8, 2017Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- ☆22May 19, 2016Updated 9 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Quick start for the vagrant box I use for ghcjs / react-haskell / pigment development☆11Jun 26, 2015Updated 10 years ago
- An implementation of Pie in Haskell☆211Nov 8, 2019Updated 6 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Jul 23, 2013Updated 12 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A demo implementation of a simple dependently-typed language☆620Nov 18, 2024Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago