mroman42 / mikrokosmosLinks
(λ) Educational lambda calculus interpreter
☆73Updated 4 years ago
Alternatives and similar repositories for mikrokosmos
Users that are interested in mikrokosmos are comparing it to the libraries listed below
Sorting:
- (λ) Category theory and lambda calculus, Bachelor's thesis☆42Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- ☆90Updated 4 years ago
- Library of the ##dependent distributed research support group☆117Updated last year
- Programming library for Agda☆134Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- theseus, functional programming language with fully reversible computation☆125Updated 6 years ago
- Total Parser Combinators in Agda☆132Updated 4 months ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- being an operating system for typechecking processes☆130Updated 2 months ago
- Functional teaching language for use in a discrete mathematics course☆176Updated 2 weeks ago
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago