☆64Jun 24, 2019Updated 6 years ago
Alternatives and similar repositories for celf
Users that are interested in celf are comparing it to the libraries listed below
Sorting:
- Lollimon, a monadic concurrent linear logic programming language☆28Oct 14, 2011Updated 14 years ago
- TeLLer is a collection of tools that explore the use of linear logic applied to narrative generation and story telling.☆18Jun 22, 2015Updated 10 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Project materials related to logic programming for interactive/reactive systems. Contains the Ceptre programming language.☆286Aug 25, 2024Updated last year
- Web based opetopic editor☆36Oct 21, 2024Updated last year
- Strange Loop 2015 talk: knot notation, enumeration, and drawing☆31Sep 27, 2015Updated 10 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Mar 23, 2015Updated 10 years ago
- Library classes for the Twelf Proof System☆23Jun 16, 2020Updated 5 years ago
- A simple development of linear logic in Coq.☆13Mar 22, 2025Updated 11 months ago
- Logic for story telling!☆36Mar 15, 2018Updated 7 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- a library for experimental linear lambda calculus☆20Mar 18, 2023Updated 2 years ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Jun 24, 2020Updated 5 years ago
- Archived materials related to Homotopy Type Theory.☆12Apr 24, 2012Updated 13 years ago
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Racket bindings for Z3☆24May 11, 2019Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Alternative Core language for GHC plugins☆39Feb 15, 2016Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- This is an attempt at painting as many bikesheds as possible with a typeclass hierarchy for idris reflecting "Algebra"☆19Dec 24, 2018Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆49Jan 10, 2026Updated last month
- microkanren in sml☆27Feb 26, 2015Updated 11 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Leibniz Equality☆19Jun 7, 2018Updated 7 years ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- An approach to higher algebra in type theory☆23May 12, 2020Updated 5 years ago