Soonad / Formality-Core
Specification of the Formality proof and programming language
☆41Updated 2 years ago
Alternatives and similar repositories for Formality-Core
Users that are interested in Formality-Core are comparing it to the libraries listed below
Sorting:
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 6 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- ☆35Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Absal ex☆57Updated last year
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- ☆36Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Package manager for Idris☆35Updated 2 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆50Updated 3 months ago