Abstracting models of strong normalization for classical calculi
Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Building on var...
Saved in:
| Published in | Journal of logical and algebraic methods in programming Vol. 111; no. C; p. 100512 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.02.2020
Elsevier |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which are both specialized for one discipline, we develop a single uniform framework for strong normalization encompassing call-by-name, call-by-value, call-by-need, call-by-push-value, non-deterministic disciplines, and any others satisfying some simple criteria. We explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs. |
|---|---|
| AbstractList | Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which are both specialized for one discipline, we develop a single uniform framework for strong normalization encompassing call-by-name, call-by-value, call-by-need, call-by-push-value, non-deterministic disciplines, and any others satisfying some simple criteria. We explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs. Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Here, building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which are both specialized for one discipline, we develop a single uniform framework for strong normalization encompassing call-by-name, call-by-value, call-by-need, call-by-push-value, non-deterministic disciplines, and any others satisfying some simple criteria. Furthermore, we explicate commonalities of previous methods and show they are special cases of the uniform framework and they extend to multi-discipline programs. |
| ArticleNumber | 100512 |
| Author | Ariola, Zena M. Downen, Paul Johnson-Freyd, Philip |
| Author_xml | – sequence: 1 givenname: Paul surname: Downen fullname: Downen, Paul email: pdownen@cs.uoregon.edu organization: University of Oregon, United States of America – sequence: 2 givenname: Philip surname: Johnson-Freyd fullname: Johnson-Freyd, Philip email: philipjf@cs.uoregon.edu, pajohn@sandia.gov organization: University of Oregon, United States of America – sequence: 3 givenname: Zena M. surname: Ariola fullname: Ariola, Zena M. email: ariola@cs.uoregon.edu organization: University of Oregon, United States of America |
| BackLink | https://www.osti.gov/biblio/2284030$$D View this record in Osti.gov |
| BookMark | eNqFkE1LAzEURbOoYK39BW4G91Pz0elkFoKl-AUFN7oOmZdEM2SSkoyC_nozHVcudBECl3se750zNPPBa4QuCF4RTDZX3apzsj-sKCZNTnBF6AzNKatoSSnmp2iZUodxrvKaMzJHN9s2DVHCYP1r0QelXSqCKXIWcuBD7KWzX3KwwRcmxAKcTMmCdEV-8O7sOTox0iW9_PkX6OXu9nn3UO6f7h93230JrK6GUq51I3mLW660qdZUtgorQmouGwOtBkal4YZwyiStOAMKRmFtWl3X9YZzwxbocpob0mBFAjtoeIPgvYZBUMrXmOFcYlMJYkgpaiMO0fYyfgqCxShIdOIoSIyCxCQoU80vKk8_npzNWPcPez2xWZz-sDqOq2kPWtk4bqaC_ZP_BmYvh40 |
| CitedBy_id | crossref_primary_10_1017_S0956796822000168 |
| Cites_doi | 10.1007/s10990-007-9018-9 10.1017/S0960129500003066 10.2307/2271658 10.1016/0304-3975(75)90017-1 10.1016/j.apal.2008.01.005 10.3233/FI-2019-1855 10.1006/inco.1994.1093 10.1016/0304-3975(87)90045-4 10.1007/BF01201353 |
| ContentType | Journal Article |
| Copyright | 2019 |
| Copyright_xml | – notice: 2019 |
| CorporateAuthor | Sandia National Lab. (SNL-CA), Livermore, CA (United States) |
| CorporateAuthor_xml | – name: Sandia National Lab. (SNL-CA), Livermore, CA (United States) |
| DBID | AAYXX CITATION OTOTI |
| DOI | 10.1016/j.jlamp.2019.100512 |
| DatabaseName | CrossRef OSTI.GOV |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 2284030 10_1016_j_jlamp_2019_100512 S2352220819301579 |
| GroupedDBID | --M 0R~ 4.4 457 4G. 7-5 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO AAYFN ABBOA ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EFLBG EJD FDB FIRID FYGXN GBLVA GBOLZ HZ~ KOM M41 NCXOZ O9- OAUVE RIG ROL SPC SPCBC SSV SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ACVFH ADCNI ADVLN AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU BNPGV CITATION SSH OTOTI |
| ID | FETCH-LOGICAL-c375t-a4e9a8b0b8def542abd0d1178a9fcbec32af8f1823a2583c2cfd0efbe777688f3 |
| IEDL.DBID | AIKHN |
| ISSN | 2352-2208 |
| IngestDate | Mon Feb 12 04:55:19 EST 2024 Thu Apr 24 22:59:22 EDT 2025 Tue Jul 01 00:37:50 EDT 2025 Fri Feb 23 02:48:13 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | C |
| Keywords | Strong normalization Biorthogonality Calling convention Symmetric candidates Sequent calculus |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c375t-a4e9a8b0b8def542abd0d1178a9fcbec32af8f1823a2583c2cfd0efbe777688f3 |
| Notes | SAND-2019-15278J NA0003525; AC04-94AL85000 USDOE National Nuclear Security Administration (NNSA) |
| OpenAccessLink | https://www.osti.gov/biblio/1595425 |
| ParticipantIDs | osti_scitechconnect_2284030 crossref_primary_10_1016_j_jlamp_2019_100512 crossref_citationtrail_10_1016_j_jlamp_2019_100512 elsevier_sciencedirect_doi_10_1016_j_jlamp_2019_100512 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | February 2020 2020-02-00 2020-02-01 |
| PublicationDateYYYYMMDD | 2020-02-01 |
| PublicationDate_xml | – month: 02 year: 2020 text: February 2020 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2020 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Girard (br0120) 1987; 50 Girard, Taylor, Lafont (br0130) 1989 Ronchi Della Rocca, Paolini (br0280) 2004 Plotkin (br0270) 1975; 1 Krivine (br0150) 2007; 20 Peyton Jones, Launchbury (br0250) 1991 Wright, Felleisen (br0330) 1994; 115 Pitts (br0260) 2000; 10 Sabry, Felleisen (br0290) 1992 Munch-Maccagnoni (br0230) 2013 Lengrand, Miquel (br0170) 2008; 153 Downen, Johnson-Freyd, Ariola (br0100) 2018 Curien, Herbelin (br0030) 2000 Gentzen (br0110) 1935; 39 Peyton Jones (br0240) 2009 Turbak, Gifford, Sheldon (br0310) 2008 Herbelin, Zimmermann (br0140) 2009 Curien, Munch-Maccagnoni (br0040) 2010 Zeilberger (br0340) 2009 Tait (br0300) 1967; 32 Munch-Maccagnoni (br0220) 2009 David, Nour (br0050) 2005; vol. 140 Downen, Johnson-Freyd, Ariola (br0090) 2015 Downen (br0060) 2017 Downen, Ariola (br0070) 2014 Liskov (br0190) 1987 Barbanera, Berardi (br0020) 1994 Levy (br0180) 2001 Miquey, Herbelin (br0210) 2018 Wadler (br0320) 2003 Downen, Ariola, Ghilezan (br0080) 2019; 170 Krivine (br0160) 2005; vol. 27 Mellies, Vouillon (br0200) 2005 Ariola, Herbelin, Saurin (br0010) 2011 Levy (10.1016/j.jlamp.2019.100512_br0180) 2001 Krivine (10.1016/j.jlamp.2019.100512_br0160) 2005; vol. 27 Mellies (10.1016/j.jlamp.2019.100512_br0200) 2005 Downen (10.1016/j.jlamp.2019.100512_br0100) 2018 Girard (10.1016/j.jlamp.2019.100512_br0130) 1989 Turbak (10.1016/j.jlamp.2019.100512_br0310) 2008 Downen (10.1016/j.jlamp.2019.100512_br0060) 2017 Tait (10.1016/j.jlamp.2019.100512_br0300) 1967; 32 Curien (10.1016/j.jlamp.2019.100512_br0030) 2000 Wadler (10.1016/j.jlamp.2019.100512_br0320) 2003 David (10.1016/j.jlamp.2019.100512_br0050) 2005; vol. 140 Miquey (10.1016/j.jlamp.2019.100512_br0210) 2018 Barbanera (10.1016/j.jlamp.2019.100512_br0020) 1994 Downen (10.1016/j.jlamp.2019.100512_br0070) 2014 Wright (10.1016/j.jlamp.2019.100512_br0330) 1994; 115 Girard (10.1016/j.jlamp.2019.100512_br0120) 1987; 50 Downen (10.1016/j.jlamp.2019.100512_br0080) 2019; 170 Munch-Maccagnoni (10.1016/j.jlamp.2019.100512_br0220) 2009 Pitts (10.1016/j.jlamp.2019.100512_br0260) 2000; 10 Krivine (10.1016/j.jlamp.2019.100512_br0150) 2007; 20 Curien (10.1016/j.jlamp.2019.100512_br0040) 2010 Lengrand (10.1016/j.jlamp.2019.100512_br0170) 2008; 153 Liskov (10.1016/j.jlamp.2019.100512_br0190) 1987 Zeilberger (10.1016/j.jlamp.2019.100512_br0340) 2009 Downen (10.1016/j.jlamp.2019.100512_br0090) 2015 Gentzen (10.1016/j.jlamp.2019.100512_br0110) 1935; 39 Peyton Jones (10.1016/j.jlamp.2019.100512_br0250) 1991 Ariola (10.1016/j.jlamp.2019.100512_br0010) 2011 Herbelin (10.1016/j.jlamp.2019.100512_br0140) 2009 Munch-Maccagnoni (10.1016/j.jlamp.2019.100512_br0230) 2013 Peyton Jones (10.1016/j.jlamp.2019.100512_br0240) Ronchi Della Rocca (10.1016/j.jlamp.2019.100512_br0280) 2004 Sabry (10.1016/j.jlamp.2019.100512_br0290) 1992 Plotkin (10.1016/j.jlamp.2019.100512_br0270) 1975; 1 |
| References_xml | – year: 2013 ident: br0230 article-title: Syntax and Models of a Non-Associative Composition of Programs and Proofs – year: 2017 ident: br0060 article-title: Sequent Calculus: A Logic and a Language for Computation and Duality – year: 2004 ident: br0280 article-title: The Parametric – volume: 39 start-page: 176 year: 1935 end-page: 210 ident: br0110 article-title: Untersuchungen über das logische Schließen, I publication-title: Math. Z. – year: 2008 ident: br0310 article-title: Design Concepts in Programming Languages – start-page: 249 year: 2014 end-page: 269 ident: br0070 article-title: The duality of construction publication-title: Programming Languages and Systems – Proceedings of the 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software – volume: 115 start-page: 38 year: 1994 end-page: 94 ident: br0330 article-title: A syntactic approach to type soundness publication-title: Inf. Comput. – start-page: 409 year: 2009 end-page: 423 ident: br0220 article-title: Focalisation and classical realisability publication-title: Computer Science Logic, Proceedings of the 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL – volume: vol. 140 start-page: 101 year: 2005 end-page: 111 ident: br0050 article-title: Why the usual candidates of reducibility do not work for the symmetric publication-title: Proceedings of the Second Workshop on Computational Logic and Applications – start-page: 636 year: 1991 end-page: 666 ident: br0250 article-title: Unboxed values as first class citizens in a non-strict functional language publication-title: Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture – volume: 1 start-page: 125 year: 1975 end-page: 159 ident: br0270 article-title: Call-by-name, call-by-value and the lambda-calculus publication-title: Theor. Comput. Sci. – volume: 32 start-page: 198 year: 1967 end-page: 212 ident: br0300 article-title: Intensional interpretations of functionals of finite type I publication-title: J. Symb. Log. – start-page: 165 year: 2010 end-page: 181 ident: br0040 article-title: The duality of computation under focus publication-title: Theoretical Computer Science – Proceedings of the 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010 – volume: 170 start-page: 1 year: 2019 end-page: 54 ident: br0080 article-title: The duality of classical intersection and union types publication-title: Fundam. Inform. – volume: 153 start-page: 3 year: 2008 end-page: 20 ident: br0170 article-title: Classical F publication-title: Ann. Pure Appl. Log. – volume: 20 start-page: 199 year: 2007 end-page: 207 ident: br0150 article-title: A call-by-name lambda-calculus machine publication-title: High.-Order Symb. Comput. – start-page: 495 year: 1994 end-page: 515 ident: br0020 article-title: A symmetric lambda calculus for “classical” program extraction publication-title: Theoretical Aspects of Computer Software, Proceedings of the International Conference – volume: vol. 27 year: 2005 ident: br0160 article-title: Realizability in classical logic publication-title: Interactive Models of Computation and Program Behaviour – start-page: 276 year: 2018 end-page: 292 ident: br0210 article-title: Realizability interpretation and normalization of typed call-by-need publication-title: Foundations of Software Science and Computation Structures – year: 2009 ident: br0240 – start-page: 127 year: 2015 end-page: 139 ident: br0090 article-title: Structures for structural recursion publication-title: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming – start-page: 288 year: 1992 end-page: 298 ident: br0290 article-title: Reasoning about programs in continuation-passing style publication-title: LFP'92 – year: 2009 ident: br0340 article-title: The Logical Basis of Evaluation Order and Pattern-Matching – start-page: 27 year: 2011 end-page: 44 ident: br0010 article-title: Classical call-by-need and duality publication-title: Typed Lambda Calculi and Applications – Proceedings of the 10th International Conference – start-page: 142 year: 2009 end-page: 156 ident: br0140 article-title: An operational account of call-by-value minimal and classical lambda-calculus in “natural deduction” form publication-title: Typed Lambda Calculi and Applications, Proceedings of the 9th International Conference – year: 1989 ident: br0130 article-title: Proofs and Types – start-page: 205 year: 2018 end-page: 225 ident: br0100 article-title: Uniform strong normalization for multi-discipline calculi publication-title: Rewriting Logic and Its Applications - Proceedings of the 12th International Workshop, WRLA 2018, Held as a Satellite Event of ETAPS – volume: 10 start-page: 321 year: 2000 end-page: 359 ident: br0260 article-title: Parametric polymorphism and operational equivalence publication-title: Math. Struct. Comput. Sci. – year: 2001 ident: br0180 article-title: Call-By-Push-Value – start-page: 17 year: 1987 end-page: 34 ident: br0190 article-title: Keynote address-data abstraction and hierarchy publication-title: Addendum to the Proceedings on Object-Oriented Programming Systems, Languages and Applications (Addendum) – start-page: 233 year: 2000 end-page: 243 ident: br0030 article-title: The duality of computation publication-title: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming – start-page: 82 year: 2005 end-page: 91 ident: br0200 article-title: Recursive polymorphic types and parametricity in an operational framework publication-title: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science – volume: 50 start-page: 1 year: 1987 end-page: 102 ident: br0120 article-title: Linear logic publication-title: Theor. Comput. Sci. – start-page: 189 year: 2003 end-page: 201 ident: br0320 article-title: Call-by-value is dual to call-by-name publication-title: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming – start-page: 142 year: 2009 ident: 10.1016/j.jlamp.2019.100512_br0140 article-title: An operational account of call-by-value minimal and classical lambda-calculus in “natural deduction” form – volume: 20 start-page: 199 year: 2007 ident: 10.1016/j.jlamp.2019.100512_br0150 article-title: A call-by-name lambda-calculus machine publication-title: High.-Order Symb. Comput. doi: 10.1007/s10990-007-9018-9 – start-page: 249 year: 2014 ident: 10.1016/j.jlamp.2019.100512_br0070 article-title: The duality of construction – volume: 10 start-page: 321 year: 2000 ident: 10.1016/j.jlamp.2019.100512_br0260 article-title: Parametric polymorphism and operational equivalence publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129500003066 – ident: 10.1016/j.jlamp.2019.100512_br0240 – volume: 32 start-page: 198 year: 1967 ident: 10.1016/j.jlamp.2019.100512_br0300 article-title: Intensional interpretations of functionals of finite type I publication-title: J. Symb. Log. doi: 10.2307/2271658 – start-page: 189 year: 2003 ident: 10.1016/j.jlamp.2019.100512_br0320 article-title: Call-by-value is dual to call-by-name – year: 2004 ident: 10.1016/j.jlamp.2019.100512_br0280 – volume: 1 start-page: 125 year: 1975 ident: 10.1016/j.jlamp.2019.100512_br0270 article-title: Call-by-name, call-by-value and the lambda-calculus publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(75)90017-1 – volume: vol. 27 year: 2005 ident: 10.1016/j.jlamp.2019.100512_br0160 article-title: Realizability in classical logic – start-page: 17 year: 1987 ident: 10.1016/j.jlamp.2019.100512_br0190 article-title: Keynote address-data abstraction and hierarchy – year: 2017 ident: 10.1016/j.jlamp.2019.100512_br0060 – volume: 153 start-page: 3 year: 2008 ident: 10.1016/j.jlamp.2019.100512_br0170 article-title: Classical Fω, orthogonality and symmetric candidates publication-title: Ann. Pure Appl. Log. doi: 10.1016/j.apal.2008.01.005 – start-page: 27 year: 2011 ident: 10.1016/j.jlamp.2019.100512_br0010 article-title: Classical call-by-need and duality – start-page: 127 year: 2015 ident: 10.1016/j.jlamp.2019.100512_br0090 article-title: Structures for structural recursion – year: 1989 ident: 10.1016/j.jlamp.2019.100512_br0130 – start-page: 276 year: 2018 ident: 10.1016/j.jlamp.2019.100512_br0210 article-title: Realizability interpretation and normalization of typed call-by-need λ-calculus with control – year: 2008 ident: 10.1016/j.jlamp.2019.100512_br0310 – year: 2001 ident: 10.1016/j.jlamp.2019.100512_br0180 – start-page: 82 year: 2005 ident: 10.1016/j.jlamp.2019.100512_br0200 article-title: Recursive polymorphic types and parametricity in an operational framework – volume: 170 start-page: 1 year: 2019 ident: 10.1016/j.jlamp.2019.100512_br0080 article-title: The duality of classical intersection and union types publication-title: Fundam. Inform. doi: 10.3233/FI-2019-1855 – start-page: 636 year: 1991 ident: 10.1016/j.jlamp.2019.100512_br0250 article-title: Unboxed values as first class citizens in a non-strict functional language – volume: 115 start-page: 38 year: 1994 ident: 10.1016/j.jlamp.2019.100512_br0330 article-title: A syntactic approach to type soundness publication-title: Inf. Comput. doi: 10.1006/inco.1994.1093 – start-page: 495 year: 1994 ident: 10.1016/j.jlamp.2019.100512_br0020 article-title: A symmetric lambda calculus for “classical” program extraction – start-page: 205 year: 2018 ident: 10.1016/j.jlamp.2019.100512_br0100 article-title: Uniform strong normalization for multi-discipline calculi – start-page: 288 year: 1992 ident: 10.1016/j.jlamp.2019.100512_br0290 article-title: Reasoning about programs in continuation-passing style – volume: 50 start-page: 1 year: 1987 ident: 10.1016/j.jlamp.2019.100512_br0120 article-title: Linear logic publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(87)90045-4 – start-page: 233 year: 2000 ident: 10.1016/j.jlamp.2019.100512_br0030 article-title: The duality of computation – start-page: 165 year: 2010 ident: 10.1016/j.jlamp.2019.100512_br0040 article-title: The duality of computation under focus – start-page: 409 year: 2009 ident: 10.1016/j.jlamp.2019.100512_br0220 article-title: Focalisation and classical realisability – volume: 39 start-page: 176 year: 1935 ident: 10.1016/j.jlamp.2019.100512_br0110 article-title: Untersuchungen über das logische Schließen, I publication-title: Math. Z. doi: 10.1007/BF01201353 – year: 2013 ident: 10.1016/j.jlamp.2019.100512_br0230 – year: 2009 ident: 10.1016/j.jlamp.2019.100512_br0340 – volume: vol. 140 start-page: 101 year: 2005 ident: 10.1016/j.jlamp.2019.100512_br0050 article-title: Why the usual candidates of reducibility do not work for the symmetric λμ-calculus |
| SSID | ssj0001687831 |
| Score | 2.1741374 |
| Snippet | Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their... |
| SourceID | osti crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 100512 |
| SubjectTerms | Biorthogonality Calling convention MATHEMATICS AND COMPUTING Sequent calculus Strong normalization Symmetric candidates |
| Title | Abstracting models of strong normalization for classical calculi |
| URI | https://dx.doi.org/10.1016/j.jlamp.2019.100512 https://www.osti.gov/biblio/2284030 |
| Volume | 111 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4QLl58GxE1PXh0A9tuu92bhEhQIxcl4bZpu62BECAC_9-ZpevjIAcPe9nsNJuv03m0X2cIuRXMQRzPCkhyMhclFhJWxWUSSWm4SNLCu_Kg_WUoB6PkaSzGNdKr7sIgrTLY_q1NL611eNMOaLaXk0n7lWHswNClgZKKNNsjDcYzCard6D4-D4bfWy1SparsTIgiEcpU9YdKptcUsMfSlXGGnAERs798VH0By-6H--kfkYMQN9Lu9teOSc3NT8hh1ZOBhiV6Su67BjcvLLKZadnmZkUXnq5wx_udzjFCnYWrlxTiVWoxesaJovDYzWxyRkb9h7feIApdEiLLU7GOdOIyrUzHqMJ5kTBtik4Rx6nSmbcwQ5xprzykEVwzobhl1hcd541LU0g1lOfnpD5fzN0FoSLWPLNMculcYizTulAwOGRwHWWSmDUJq3DJbSghjp0sZnnFFZvmJZg5gplvwWySuy-h5baCxu7PZQV4_ksRcrDxuwVbOD0ohOVvLfKEQIqB_wVDdvnfYVtkn2GKXRK1r0h9_bFx1xCHrM1N0LNPAKjasw |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BO8DCG1HKwwMjURs7TpyNCoFaHl0AiS2yHRsVVS2i7f_nLnV4DDAwZIlyUfTZvvvO-XwHcCa5Qx7PS0xychclFhNWJdIkSlMjZJKV3lU_2u-Haf8puXmWzytwWZ-FIVll8P1Ln15563CnE9DsvI1GnQdO3IFTSMNJKrN8FZpUnUo2oNkb3PaHX1stqcpU1ZmQTCKyqesPVUqvV8SeSlfGOWkGZMx_i1GNKS67b-Hnegs2Am9kveWnbcOKm-zAZt2TgYUlugsXPUObF5bUzKxqczNjU89mtOP9wibEUMfh6CVDvsossWcaKIaXXYxHe_B0ffV42Y9Cl4TIikzOI524XCvTNap0XiZcm7JbxnGmdO4tjpDg2iuPaYTQXCphufVl13njsgxTDeXFPjQm04k7ACZjLXLLU5E6lxjLtS4VvhwzuK4yScxbwGtcChtKiFMni3FRa8VeiwrMgsAslmC24PzT6G1ZQePvx9Ma8OLHRCjQx_9t2KbhISMqf2tJJ4RWHOMvOrLD_772FNb6j_d3xd1geNuGdU7pdiXaPoLG_H3hjpGTzM1JmHMfV_ndmQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Abstracting+models+of+strong+normalization+for+classical+calculi&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Downen%2C+Paul&rft.au=Johnson-Freyd%2C+Philip&rft.au=Ariola%2C+Zena+M.&rft.date=2020-02-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=111&rft_id=info:doi/10.1016%2Fj.jlamp.2019.100512&rft.externalDocID=S2352220819301579 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon |