blntk / sfplLinks
A simple functional programming language.
☆22Updated 4 years ago
Alternatives and similar repositories for sfpl
Users that are interested in sfpl are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- A Teeny Type Theory☆27Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A WIP compiler for a functional language. Very incomplete!☆16Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- ☆51Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆72Updated 9 months ago
- ICFP tutorial☆39Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Fωμ type checker and compiler☆55Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- A bidirectional type checker☆66Updated 8 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- ☆24Updated last week