Download PDFOpen PDF in browserA New Proof of P-time Completeness of Linear Lambda Calculus12 pages•Published: December 18, 2015AbstractWe give a new proof of P-time completeness ofthe 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.
|