mishun / henk2000View external linksLinks
Pure Type Systems for Functional Programming
☆11Jun 11, 2014Updated 11 years ago
Alternatives and similar repositories for henk2000
Users that are interested in henk2000 are comparing it to the libraries listed below
Sorting:
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- pure type system language - henk 2000 ported to megaparsec, pretty☆22Oct 8, 2015Updated 10 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Pure Type Systems for Functional Programming☆31Nov 21, 2020Updated 5 years ago
- Implementation of sprintf for Coq☆18Apr 6, 2020Updated 5 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A handful of potentially useful crap for Standard ML☆21Sep 11, 2017Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Jun 9, 2024Updated last year
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Dec 22, 2018Updated 7 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- Simple FRP implementation for Haskell. See blog post at http://travis.athougies.net/☆14May 5, 2015Updated 10 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- An implementation of Functional Reactive Programming☆41Mar 2, 2015Updated 10 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- A command-line tool to generate Latex (inference rules) from inductive coq definitions.☆30Aug 23, 2016Updated 9 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Deriving Storable instances using GHC.Generics☆16Apr 9, 2022Updated 3 years ago
- SMTLib2 interface implementation for Haskell☆18Dec 6, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- An image-processing library for Haskell.☆10Mar 26, 2016Updated 9 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Library of Coq proof automation☆16Feb 15, 2022Updated 3 years ago
- Modern Compiler Implementation in ML☆11May 7, 2017Updated 8 years ago
- xmonad in Coq☆46Jul 9, 2012Updated 13 years ago