sacerdot/sesame sacerdot/sesame

  • Stars
    star
    1
  • Language
    OCaml
  • License
    MIT License
  • Created 4 months ago
  • Updated 4 months ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
sacerdot/sesame
github

sacerdot

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

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

More Repositories

1

ocaml-http

OCaml
15
star
2

MiniErlangBlockchain

Homework: a mini-blockchain implementation in Erlang
Erlang
9
star
3

CovidMonitoring

A small project in Erlang to pass the exam of Emerging Programming Paradigms @ University of Bologna
Erlang
6
star
4

matita

An Interactive Theorem Prover for a variant of the Calculus of (Co)Inductive Constructions
Mathematica
5
star
5

Minimalist-Type-Theory-In-Lambda-Prolog

An implementation in Lambda-Prolog of the Minimalist Type Theory
Prolog
4
star
6

Emerging2223Project

Emerging Programming Languages 20223/2023 Project Specification
3
star
7

closure-conversion-machine

Artifact for the Closure Conversion and Abstract Machines paper
OCaml
1
star
8

SCAM

The implementation of the Strong Crumbling Abstract Machine (SCAM) for the Strong Call-by-value lambda-calculus (see paper at LICS 2021)
OCaml
1
star
9

Crumbling-Abstract-Machines

This repository contains the formalization of part of the theory behind the Crumbling Abstract Machines, that has been introduced and partially developed in Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, and Claudio Sacerdoti Coen. 2019. Crumbling Abstract Machines. In Proceedings of ACM Conference (Conferenceโ€™17). ACM, New York, NY,USA,39 pages.
Mathematica
1
star