https://github.com/sacerdot/sesame

Implementation in OCaml of a strong reduction machine for Intuitionistic Multiplicative Exponential Linear Logic (IMELL) that has linear overhead on the number of reduction steps and the size of the initial term
https://github.com/sacerdot/sesame

Last synced: 22 days ago
JSON representation

Implementation in OCaml of a strong reduction machine for Intuitionistic Multiplicative Exponential Linear Logic (IMELL) that has linear overhead on the number of reduction steps and the size of the initial term

• Host: GitHub
• URL: https://github.com/sacerdot/sesame
• Owner: sacerdot
• License: mit
• Created: 2024-02-19T18:26:27.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2024-02-19T19:26:03.000Z (11 months ago)
• Last Synced: 2024-10-26T22:14:40.587Z (2 months ago)
• Language: OCaml
• Size: 662 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# SESAME

An implementation of the Strong Exponential Substitution Abstract Machine without

Erasure (SESAME) described in the paper.

"IMELL Cut Elimination with Linear Overhead" by

B. Accattoli and C. Sacerdoti Coen, submitted at FSCD 2024.

## Description

The sesame executable implements a REPL (Read Eval Print Loop) to evaluate

Intuitionistic Multiplicative Exponential Linear Logic (IMELL) terms. The loop

asks the user to enter a term, checks the term for properness and then evaluates

it, showing all reduction steps.

The terms are encoded in the Exponential Substitution Calculus (ESC) syntax.

The implementation is based on term graphs. Reduction takes time which is

bi-linear in the size of the initial term and the number of

exponential/multiplicative steps of IMELL.

Before starting the REPL loop, some example terms are evaluated. Among them

there are examples from a family of terms that perform a number of exponential

steps without even a single multiplicative steps. They show that, contrarily to

what happens for lambda-calculi, the number of beta-steps alone is not a cost

model.

## Library API

Searchable documentation for every datatype and function can be found at

.

## Compiling and running sesame

To compile sesame, one needs a working installation of OCaml and Dune.

The simplest way is to use the OPAM package manager for OCaml:

- Install OPAM 

- Install dune, odoc and sherlodoc via opam:

  `opam update && opam install dune odoc sherlodoc`

- [optional] Compile sesame's documentation via dune and open it in a browser:

  `opam build @doc && open _build/default/_doc/_html/sesame/index.html`

  The same documentation can be found at 

- Run sesame's REPL: `opam exec sesame`

  The input grammar is printed by the REPL itself.