samskivert / composeLinks
An experimental programming language.
☆19Updated 6 years ago
Alternatives and similar repositories for compose
Users that are interested in compose are comparing it to the libraries listed below
Sorting:
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 3 years ago
- Source files used for the Cedille Cast videos☆13Updated last month
- ☆16Updated 11 months ago
- My Agda blog/lab/playground☆12Updated last week
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 months ago
- ☆12Updated 10 years ago
- A TOML parser for Idris 2☆17Updated last year
- A toy dependent typed language.☆36Updated this week
- A simple λProlog interpreter☆20Updated 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
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- A simple prolog implementation in Rust☆26Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated last month
- Formalization of type theory☆22Updated 4 years ago
- A mini language for logic programming☆23Updated 5 years ago
- translations of a lambda abstraction to combinations of operators☆18Updated 6 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago