Djinn, Monotonic

4 pages•Published: May 15, 2012

Abstract

Dyckhoff's algorithm for contraction-free proof search in intuitionistic propositional logic (popularized by Augustsson as the type-directed program synthesis tool, Djinn) is a simple program with a rather tricky termination proof. In this talk, I describe my efforts to reduce this program to a steady structural descent. On the way, I shall present an attempt at a compositional approach to explaining termination, via a uniform presentation of memoization.

In: Ekaterina Komendantskaya, Ana Bove and Milad Niqui (editors). PAR-10. Partiality and Recursion in Interactive Theorem Provers, vol 5, pages 14-17.

Links:	https://easychair.org/publications/paper/wV7
	https://doi.org/10.29007/33k5

BibTeX entry

@inproceedings{PAR-10:Djinn_Monotonic,
  author    = {Conor McBride},
  title     = {Djinn, Monotonic},
  booktitle = {PAR-10. Partiality and Recursion in Interactive Theorem Provers},
  editor    = {Ekaterina Komendantskaya and Ana Bove and Milad Niqui},
  series    = {EPiC Series in Computing},
  volume    = {5},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/wV7},
  doi       = {10.29007/33k5},
  pages     = {14-17},
  year      = {2012}}

Download PDF Open PDF in browser