{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:30:42Z","timestamp":1648758642647},"reference-count":27,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.113.5","type":"journal-article","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T13:09:00Z","timestamp":1364476140000},"page":"11-26","source":"Crossref","is-referenced-by-count":1,"title":["Proof nets and the call-by-value lambda-calculus"],"prefix":"10.4204","volume":"113","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[{"name":"INRIA & Ecole Polytechnique"}]}],"member":"2720","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"key":"phdaccattoli","volume-title":"Jumping around the box: graphical and operational studies on \u03bb-calculus and Linear Logic","author":"Accattoli","year":"2011"},{"key":"DBLP:conf\/csl\/AccattoliG09","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-04027-6_7","article-title":"Jumping Boxes","volume-title":"CSL","author":"Accattoli","year":"2009"},{"key":"DBLP:conf\/csl\/AccattoliK10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-15205-4_30","article-title":"The Structural \u03bb-Calculus","volume-title":"CSL","author":"Accattoli","year":"2010"},{"key":"DBLP:conf\/flops\/AccattoliP12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-29822-6_4","article-title":"Call-by-Value Solvability, revisited","volume-title":"FLOPS","author":"Accattoli","year":"2012"},{"key":"DBLP:conf\/lics\/CosmoK97","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/LICS.1997.614927","article-title":"Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)","volume-title":"LICS","author":"Cosmo","year":"1997"},{"issue":"3","key":"DBLP:journals\/mscs\/CosmoKP03","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S0960129502003791","article-title":"Proof Nets And Explicit Substitutions","volume":"13","author":"Cosmo","year":"2003","journal-title":"Math. Str. in Comput. Sci."},{"key":"Danos:Thesis:90","volume-title":"La Logique Lin\u00e9aire appliqu\u00e9 \u00e0 l'\u00e9tude de divers processus de normalisation (principalment du \u03bb-calcul)","author":"Danos","year":"1990"},{"key":"Danos95proof-netsand","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1017\/CBO9780511629150.016","article-title":"Proof-nets and the Hilbert space","volume-title":"Advances in Linear Logic","author":"Danos","year":"1995"},{"key":"DBLP:journals\/tcs\/DanosR99","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(99)00049-3","article-title":"Reversible, Irreversible and Optimal lambda-Machines","volume":"227","author":"Danos","year":"1999","journal-title":"Theor. Comput. Sci."},{"key":"DBLP:conf\/gg\/FernandezM02","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45832-8_8","article-title":"Call-by-Value lambda-Graph Rewriting Without Rewriting","volume-title":"ICGT","author":"Fern\u00e1ndez","year":"2002"},{"key":"DBLP:journals\/corr\/abs-1003-5515","doi-asserted-by":"publisher","first-page":"49","DOI":"10.4204\/EPTCS.22.5","article-title":"Labelled Lambda-calculi with Explicit Copy and Erase","volume-title":"LINEARITY","author":"Fern\u00e1ndez","year":"2009"},{"key":"DBLP:conf\/pldi\/FlanaganSDF93","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/155090.155113","article-title":"The Essence of Compiling with Continuations","volume-title":"PLDI","author":"Flanagan","year":"1993"},{"key":"DBLP:journals\/tcs\/Girard87","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"DBLP:conf\/tlca\/HerbelinZ09","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-02273-9_12","article-title":"An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in \"Natural Deduction\" Form","volume-title":"TLCA","author":"Herbelin","year":"2009"},{"issue":"4","key":"DBLP:journals\/iandc\/KesnerL07","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ic.2006.08.008","article-title":"Resource operators for lambda-calculus","volume":"205","author":"Kesner","year":"2007","journal-title":"Inf. Comput."},{"key":"DBLP:conf\/tlca\/Laurent99","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-48959-2_16","article-title":"Polarized Proof-Nets: Proof-Nets for LC","volume-title":"TLCA","author":"Laurent","year":"1999"},{"key":"phdlaurent","volume-title":"\u00c9tude de la polarisation en logique","author":"Laurent","year":"2002"},{"issue":"1","key":"DBLP:journals\/tcs\/Laurent03","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(01)00297-3","article-title":"Polarized proof-nets and \u03bb\u03bc-calculus","volume":"290","author":"Laurent","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"DBLP:conf\/ifl\/Mackie05","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11964681_2","article-title":"Encoding Strategies in the Lambda Calculus with Interaction Nets","volume-title":"IFL","author":"Mackie","year":"2005"},{"key":"DBLP:journals\/tcs\/MaraistOTW99","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(98)00358-2","article-title":"Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus","volume":"228","author":"Maraist","year":"1999","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"DBLP:journals\/tcs\/Plotkin75","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-Name, Call-by-Value and the lambda-Calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"DBLP:journals\/mscs\/PravatoRR99","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1017\/S0960129598002722","article-title":"The call-by-value \u03bb-calculus: a semantic investigation","volume":"9","author":"Pravato","year":"1999","journal-title":"Math. Str. in Comput. Sci."},{"key":"Reg:Thesis:92","volume-title":"Lambda-calcul et r\u00e9seaux","author":"Regnier","year":"1992"},{"key":"DBLP:journals\/lisp\/SabryF93","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01019462","article-title":"Reasoning about Programs in Continuation-Passing Style","volume":"6","author":"Sabry","year":"1993","journal-title":"Lisp and Symbolic Computation"},{"key":"tranquillithesis","volume-title":"Nets Between Determinism and Nondeterminism","author":"Tranquilli","year":"2009"},{"issue":"20","key":"DBLP:journals\/tcs\/Tranquilli11","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.tcs.2010.12.022","article-title":"Intuitionistic differential nets and lambda-calculus","volume":"412","author":"Tranquilli","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"phdvaux","volume-title":"\u03bb-calcul diff\u00e9rentiel et logique classique: interactions calculatoires","author":"Vaux","year":"2007"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T07:02:18Z","timestamp":1365058938000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1303.7326v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":27,"URL":"https:\/\/doi.org\/10.4204\/eptcs.113.5","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,28]]}}}