Skip to content
A library and case-study for linear, intrinsically-typed interpreters in Agda
Agda Makefile
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
lib [ fix ] Minor Dec 11, 2019
src [ fix ] Add some comments; align with paper Dec 21, 2019
.agda-lib [ new ] more laws, useful definitions on e.g. ✴ Jul 18, 2019
.gitignore [ new ] Ignore some build artifacts Oct 22, 2019
.gitmodules
LICENSE [ add ] MIT license Dec 20, 2019
Makefile
README.md [ new ] Agda links in README Oct 21, 2019

README.md

Linear, Intrinsically-Typed Interpreters

An Agda library for programming with separation logic, based on proof-relevant separation algebras. The code is organized as follows:

└── src
    ├── Everything.agda       Development entrypoint
    ├── Relation
    │   └── Ternary           The library
    ├── Sessions              Session-types case study
    │   ├── Semantics.agda
    │   ├── Syntax.agda
    │   ├── ...
    ├── Typed
    │   ├── LTLC.agda         LTLC semantics
    │   ├── LTLCRef.agda      LTLCRef semantics

The code has been type-checked using Agda 2.6.0.1. The standard library version that was used is included in lib/.

Agda is usually developed in Emacs. It is highly recommended to use Agda's emacs mode to typecheck the code. This does not only provide type-sensitive highlighting, but also allows you to navigate the code by jumping to definitions.

You can’t perform that action at this time.