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 Teeny Type Theory☆27Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- ☆48Updated 3 weeks ago
- Setoid type theory implementation☆38Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- ☆23Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Anders: Cubical Type Checker☆23Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 7 months ago
- ICFP tutorial☆39Updated 4 years ago
- ☆22Updated 4 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- GRIN backend for Idris2☆33Updated 3 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago