sacerdot/Minimalist-Type-Theory-In-Lambda-Prolog

Stars
4
Rank 3,284,970 (Top 66 %)
Language
Prolog
Created almost 8 years ago
Updated almost 6 years ago

sacerdot/Minimalist-Type-Theory-In-Lambda-Prolog

sacerdot

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

An implementation in Lambda-Prolog of the Minimalist Type Theory

ocaml-http

MiniErlangBlockchain

Homework: a mini-blockchain implementation in Erlang

CovidMonitoring

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

matita

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

Emerging2223Project

Emerging Programming Languages 20223/2023 Project Specification

closure-conversion-machine

Artifact for the Closure Conversion and Abstract Machines paper

matita-lean

Porting of Matita's declarative syntax to Lean

SCAM

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

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.

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