Skip to content
Agda formalization of Intuitionistic Propositional Logic
TeX 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.
fscd19 [ travis ] add plainurl.bst (not contained in docker image) Apr 28, 2019
notes Gitignores. Jul 11, 2019
ppdp19
src-cbpv [ src-cbpv ] additional laws (not needed for the paper) Jul 12, 2019
src-focusing [ src-focusing ] allow unsolved metas for deployment sake May 10, 2019
src [ src-cbpv ] start to prove comonad coalgebra laws Jun 11, 2019
types19 [ types19 ] last fixes before talk Jul 11, 2019
.gitignore [ ppdp19 ] updated to latest acmart Jul 12, 2019
.travis.yml [ travis ] Try docker image adnrv/texlive:custom Apr 28, 2019
LICENSE Initial commit May 16, 2018
Makefile [ src-cbpv ] deploy sources Jun 12, 2019
README.md [ src-cbpv ] deploy sources Jun 12, 2019
_config.yml Set theme jekyll-theme-leap-day Jul 23, 2018

README.md

ipl Build Status

Agda formalization of Intuitionistic Propositional Logic (IPL)

Agda HTML listing.

Normalization by Evaluation for IPL, Call-By-Push-Value, and Polarized Lambda Calculus (without soundness)

The simple Normalization by Evaluation (NbE) algorithm that produces from every IPL (CBPV, resp.) derivation a normal derivation.

Version published 2019-02-16 on arXiv:

Version presented 2018-07-19 at the Initial Types Club:

Soundness

Soundness of NbE means that the computational behavior (functional interpretation) of IPL proofs is preserved by normalization.

We implement sound-by-construction NbE using Kripke predicates.

You can’t perform that action at this time.