A New Proof of P-time Completeness of Linear Lambda Calculus

12 pages•Published: December 18, 2015

Abstract

We give a new proof of P-time completeness of
the Linear Lambda Calculus, which was originally given by H. Mairson in 2003.
Our proof uses an essentially different Boolean type from the type that Mairson used.
Moreover the correctness of our proof can be machined-checked using an implementation of Standard ML.

Keyphrases: boolean circuits, linear lambda calculus, linear logic, p time completeness

In: Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, vol 35, pages 119-130.

Links:	https://easychair.org/publications/paper/MWM
	https://doi.org/10.29007/svwc

BibTeX entry

@inproceedings{LPAR-20:New_Proof_P_time,
  author    = {Satoshi Matsuoka},
  title     = {A New Proof of P-time Completeness of Linear Lambda Calculus},
  booktitle = {LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations},
  editor    = {Ansgar Fehnker and Annabelle McIver and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {35},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/MWM},
  doi       = {10.29007/svwc},
  pages     = {119-130},
  year      = {2015}}

Download PDF Open PDF in browser