{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:31:45Z","timestamp":1725481905613},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We give a new proof of P-time completeness of<\/jats:p><jats:p>the Linear Lambda Calculus, which was originally given by H. Mairson in 2003.<\/jats:p><jats:p>Our proof uses an essentially different Boolean type from the type that Mairson used.<\/jats:p><jats:p>Moreover the correctness of our proof can be machined-checked using an implementation of Standard ML.<\/jats:p>","DOI":"10.29007\/svwc","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:15Z","timestamp":1516748655000},"page":"119-106","source":"Crossref","is-referenced-by-count":0,"title":["A New Proof of P-time Completeness of Linear Lambda Calculus"],"prefix":"10.29007","volume":"35","author":[{"given":"Satoshi","family":"Matsuoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:05:18Z","timestamp":1516748718000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/MWM"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/svwc","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}