Interactive Theorem Proving for students
☆21Aug 26, 2023Updated 2 years ago
Alternatives and similar repositories for elfe
Users that are interested in elfe are comparing it to the libraries listed below
Sorting:
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- Clipboard synchronization tool☆13Mar 8, 2026Updated last week
- 💠 HL7: FHIR Application Server ISO/HL7 27931:2009☆11Feb 17, 2026Updated last month
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- IsarMathLib is a library of formalized mathematics for Isabelle/ZF.☆18Mar 1, 2026Updated 2 weeks ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- 💬 CHAT: Instant Messenger. ITU/IETF: 3394, 3565, 5280, 5480, 5652, 5755 8551, X.509, CMS, PKCS-10, PCKS-7, OCSP, LDAP, DNS; ANSI: X9-42,…☆10Mar 4, 2026Updated 2 weeks ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Communicate with Erlang node from Haskell☆13Mar 14, 2021Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- Type theory in type theory☆16Feb 26, 2012Updated 14 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A controlled natural language for calculus of inductive constructions, based on Forthel.☆14Mar 2, 2021Updated 5 years ago
- A type-level, statically-verified Haskell embedded domain specific language (EDSL) for writing guitar tablature.☆26Jul 9, 2022Updated 3 years ago
- Existential type.☆37Feb 11, 2026Updated last month
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Coq solutions to exercises in HoTT book☆12Jan 31, 2014Updated 12 years ago
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- Schemes in Lean (v2)☆43Jul 30, 2020Updated 5 years ago
- SAMPLE: Elixir Application☆13Jan 26, 2021Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- The collected works of R. F. C. Walters☆13Nov 12, 2024Updated last year
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- 🛡️ CA: Certificate Authority. ДСТУ: 4145. ITU/IETF: 3279, 5755, 7030, X.509.☆20Mar 8, 2026Updated last week
- The opentheory tool processes higher order logic theory packages☆17Mar 21, 2023Updated 2 years ago
- ☆25Mar 13, 2026Updated last week
- Minimal type inference Algorithm W and Algorithm M in F#☆35Oct 23, 2023Updated 2 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- ☆17Feb 16, 2026Updated last month
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Development for: Formally Verified Speculation and Deoptimization in a JIT Compiler☆13Nov 17, 2022Updated 3 years ago
- A generic Haskell library for expressing rewrite rules with safe treatment of variables and binders☆12Jan 31, 2026Updated last month
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 9 months ago
- A programming language☆11Jan 7, 2022Updated 4 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Jul 11, 2021Updated 4 years ago