mishun / henk2000Links
Pure Type Systems for Functional Programming
☆11Updated 11 years ago
Alternatives and similar repositories for henk2000
Users that are interested in henk2000 are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆59Updated last year
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Type theory in type theory☆16Updated 13 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago