cognitive-engineering-lab / document-calculus
Accompanying materials for "A Core Calculus for Documents"
☆31Updated last year
Alternatives and similar repositories for document-calculus:
Users that are interested in document-calculus are comparing it to the libraries listed below
- Demo for dependent types + runtime code generation☆66Updated this week
- Benchmark repository of polyglot effect handler examples☆23Updated 3 months ago
- EGraphs in OCaml☆65Updated last year
- Graph Theory [maintainers=@chdoc,@damien-pous]☆36Updated last week
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- A custom parser/auto-formatter for Standard ML☆75Updated last year
- Mystery Languages☆38Updated last year
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆28Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated last month
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- ☆34Updated 10 months ago
- ☆16Updated 10 months ago
- SPSC: A Small Positive Supercompiler☆34Updated 9 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A stepping debugger for Standard ML (SML)☆24Updated last year
- ☆30Updated 4 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A template for you to implement Hazelnut yourself☆21Updated last month
- Slog 1.0☆38Updated 8 months ago
- A toy dependent typed language.☆28Updated this week
- 🪆 A Staged Type Theory☆34Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A deterministic parser with fused lexing☆72Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆49Updated 2 months ago
- Playing with type systems☆48Updated last month
- source code for the bondi programming language☆40Updated 6 years ago