https://github.com/RedPRL/algaett

🦠 An experimental elaborator for dependent type theory using effects and handlers
https://github.com/RedPRL/algaett

algebraic-effects normalization-by-evaluation ocaml ocaml-program proof-assistant type-theory

Last synced: about 2 months ago
JSON representation

🦠 An experimental elaborator for dependent type theory using effects and handlers

• Host: GitHub
• URL: https://github.com/RedPRL/algaett
• Owner: RedPRL
• License: apache-2.0
• Created: 2022-04-23T03:58:14.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-10-03T01:13:18.000Z (about 1 year ago)
• Last Synced: 2024-05-31T10:39:24.090Z (4 months ago)
• Topics: algebraic-effects, normalization-by-evaluation, ocaml, ocaml-program, proof-assistant, type-theory
• Language: OCaml
• Homepage:
• Size: 620 KB
• Stars: 30
• Watchers: 7
• Forks: 0
• Open Issues: 9
• Metadata Files:
  • Readme: README.markdown
  • License: LICENSE

Awesome Lists containing this project

README

        
# 🦠 algaett’s not algaeff

This development is an experiment with the following goals:

1. Adopt smalltt and related techniques into the cubical world.

2. Show how various OCaml packages of ours fit together.

3. Write natural grammars without neccesarily conforming to LR(k).

4. Use lots of Unicode emojis.

## Try It Out!

```bash

opam pin git+https://github.com/RedPRL/bantorra

opam pin git+https://github.com/RedPRL/algaett

cat tests/example.ag

algaett tests/example.ag

```

The last line should not have an output, which means it type checks!

## Important Ideas

### Ideas from Smalltt

The core NbE algorithm closely follows [András Kovács’s smalltt.](https://github.com/AndrasKovacs/smalltt)

Here are some notable differences:

1. We intentionally do not implement unification.

2. The universe itself (as a term) is not inferable, which means that the checking might have to be redone with the type unfolded.

   ```

   📌 😄 : 🌌 🆙 2️⃣ 👉 🌌 🆙 1️⃣

   📌 _ 👉 🌌 : 😄

   ```

   The type inference from the universe 🌌 will fail, and then the type checking will be redone with 😄 unfolded to 🌌 🆙 1️⃣.

3. The conversion checker is generalized to handle subtyping generated by cumulativity.

### Modular Development

- [algaeff](https://redprl.org/algaeff/algaeff/Algaeff): reusable effects-based components

- [asai](https://redprl.org/asai/asai/Asai): error messages _(not actively used yet)_

- [bantorra](https://redprl.org/bantorra/bantorra): unit resolution _(not actively used yet)_

- [bwd](https://redprl.org/bwd/bwd/Bwd): backward lists

- [mugen](https://redprl.org/mugen/mugen/Mugen): universe levels

- [yuujinchou](https://redprl.org/yuujinchou/yuujinchou): namespaces and name modifier

### Parser beyond LR

We are using the Earley’s parsing algorithm which can handle all context-free grammars.

## Documentation

[Here is the API documentation.](https://redprl.org/algaett/algaett/)