![codecov](https://img.shields.io/codecov/c/github/aya-prover/aya-dev?logo=codecov&logoColor=white)
Website contains:
[!WARNING]
Aya is under active development, so don't be surprised about bugs, usability or performance issues
(please file issues or create threads in discussions!), but we have the goal to make it as
user-friendly as we can feasibly do.
What to expect?
- Dependent types, including Π-types, Σ-types, indexed families, etc.
You could write a sized-vector type.
- Set-level cubical type theory (XTT).
- Pattern matching with first-match semantics.
Checkout the red-black tree (without deletion yet).
- A JIT-compiler that translates Aya code to higher-order abstract syntax in Java.
This makes the interpreter to run tree-sort 10x faster! See benchmark code.
- Overlapping and order-independent patterns. Very useful in theorem proving.
- A literate programming mode with inline code fragment support, inspired from Agda and 1lab.
You may preview the features (in Chinese)
here.
- Binary operators, with precedence specified by a partial ordering
(instead of a number like in Haskell or Agda).
- A fairly good termination checker.
We adapted some code from Agda's implementation to accept more definitions such as the
testSwapAdd
example in this file (which are rejected by, e.g. Arend).
See also use as a library.
Contributing to Aya
[!IMPORTANT]
Since you need Java 21 to set this project up, in case your choice
of IDE is IntelliJ IDEA, version 2023.3 or higher is required.
- Questions or concerns are welcomed in the discussion area.
We will try our best to answer your questions, but please be nice.
- We welcome nitpicks on error reporting! Please let us know anything not perfect.
We have already implemented several user-suggested error messages.
- Before contributing in any form, please read
the contribution guideline thoroughly
and make sure you understand your responsibilities.
- Please follow the Code of Conduct to
ensure an inclusive and welcoming community atmosphere.
- Ask @ice1000 or simply create a ticket in the discussion to become an organization member.
- If you want to contribute, ask before doing anything.
We are reluctant to accept PRs that contradict our design goals.
We value your time and enthusiasm, so we don't want to close your PRs :)
Use as a library
It's indexed in mvnrepository,
and here are some example build configurations:
<!-- Maven -->
<dependency>
<groupId>org.aya-prover</groupId>
<artifactId>[project name]</artifactId>
<version>[latest version]</version>
</dependency>
// Gradle
implementation group: 'org.aya-prover', name: '[project name]', version: '[latest version]'
[project name]
specifies the subproject of Aya you want to use,
and the options are pretty
, base
, cli-impl
, parser
, etc.
- The syntax definitions live in
syntax
.
- The parser lives in
parser
(the generated parsing code) and producer
(transformer from parse tree to concrete syntax tree).
- The type checker lives in
base
.
- The JIT compiler lives in
jit-compiler
.
- The generalized pretty printing framework is in
pretty
.
- The library system, literate mode, single-file type checker, and basic REPL are in
cli-impl
.
- The generalized tree builder, generalized termination checker,
and a bunch of other utilities (files, etc.) are in
tools
.
- The generalized binary operator parser, generalized mutable graph are
in
tools-kala
because they depend on a larger subset of the kala library.
- The command and argument parsing framework is in
tools-repl
.
It offers an implementation of jline3 parser based on Grammar-Kit and relevant facilities.
- The literate-markdown related infrastructure is in
tools-md
.
It offers commonmark extensions for literate mode of any language with a highlighter.
[latest version]
is what you see on this badge
.