{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:50:35Z","timestamp":1762005035664},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T00:00:00Z","timestamp":1538524800000},"content-version":"vor","delay-in-days":2,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1016\/j.entcs.2018.10.012","type":"journal-article","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T16:49:56Z","timestamp":1540918196000},"page":"185-201","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Formal Meta-level Analysis Framework for Quantum Programming Languages"],"prefix":"10.1016","volume":"338","author":[{"given":"Mohamed Yousri","family":"Mahmoud","sequence":"first","affiliation":[]},{"given":"Amy P.","family":"Felty","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2018.10.012_br0010","series-title":"15th International Conference on Theorem Proving in Higher-Order Logics (TPHOLs)","first-page":"13","article-title":"Combining higher order abstract syntax with tactical theorem proving and (co)induction","author":"Ambler","year":"2002"},{"key":"10.1016\/j.entcs.2018.10.012_br0020","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","volume":"2","author":"Andreoli","year":"1992","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/j.entcs.2018.10.012_br0030","series-title":"11th Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP)","first-page":"3:1","article-title":"The logic of hereditary Harrop formulas as a specification logic for Hybrid","author":"Battell","year":"2016"},{"key":"10.1016\/j.entcs.2018.10.012_br0040","series-title":"34th Annual Symposium on Foundations of Computer Science","first-page":"362","article-title":"A quantum bit commitment scheme provably unbreakable by both parties","author":"Brassard","year":"1993"},{"key":"10.1016\/j.entcs.2018.10.012_br0050","series-title":"Postproceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2016)","first-page":"57","article-title":"Formalized meta-theory of sequent calculi for substructural logics","volume":"vol. 332","author":"Chaudhuri","year":"2017"},{"key":"10.1016\/j.entcs.2018.10.012_br0060","series-title":"13th ACM SIGPLAN International Conference on Functional Programming (ICFP)","first-page":"143","article-title":"Parametric higher-order abstract syntax for mechanized semantics","author":"Chlipala","year":"2008"},{"key":"10.1016\/j.entcs.2018.10.012_br0070","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1017\/S0960129511000041","article-title":"The representational adequacy of Hybrid","volume":"21","author":"Crole","year":"2011","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.entcs.2018.10.012_br0080","author":"D\u00edaz-Caro"},{"key":"10.1016\/j.entcs.2018.10.012_br0090","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10817-010-9194-x","article-title":"Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax","volume":"48","author":"Felty","year":"2012","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/j.entcs.2018.10.012_br0100","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10817-015-9327-3","article-title":"The next 700 challenge problems for reasoning with higher- order abstract syntax representations: Part 2\u2014a survey","volume":"55","author":"Felty","year":"2015","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/j.entcs.2018.10.012_br0110","series-title":"Conventions for quantum pseudocode","author":"Knill","year":"1996"},{"key":"10.1016\/j.entcs.2018.10.012_br0120","author":"Mahmoud"},{"key":"10.1016\/j.entcs.2018.10.012_br0130","author":"Mahmoud"},{"key":"10.1016\/j.entcs.2018.10.012_br0140","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/504077.504080","article-title":"Reasoning with higher-order abstract syntax in a logical framework","volume":"3","author":"McDowell","year":"2002","journal-title":"AC Transactions on Computational Logic"},{"key":"10.1016\/j.entcs.2018.10.012_br0150","author":"Laurent"},{"key":"10.1016\/j.entcs.2018.10.012_br0160","series-title":"A Procedural Formalism for Quantum Computing","author":"\u00d6mer","year":"1998"},{"key":"10.1016\/j.entcs.2018.10.012_br0170","series-title":"Postproceedings of the 14th International Conference on Quantum Physics and Logic (QPL 2017)","first-page":"119","article-title":"QWIRE practice: Formal verification of quantum circuits in Coq","volume":"vol. 266","author":"Rand","year":"2018"},{"key":"10.1016\/j.entcs.2018.10.012_br0180","series-title":"Algebraic and Logical Methods in Quantum Computation","author":"Ross","year":"2015"},{"key":"10.1016\/j.entcs.2018.10.012_br0190","series-title":"5th International Conference on Mathematics of Program Construction (MPC)","first-page":"80","article-title":"Quantum programming","author":"Sanders","year":"2000"},{"key":"10.1016\/j.entcs.2018.10.012_br0200","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1017\/S0960129506005238","article-title":"A lambda calculus for quantum computation with classial control","volume":"16","author":"Selinger","year":"2006","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.entcs.2018.10.012_br0210","series-title":"17th Brazilian Symposium on Programming Languages (SBLP)","first-page":"61","article-title":"A double effect \u03bb-calculus for quantum computation","author":"Vizzotto","year":"2013"},{"key":"10.1016\/j.entcs.2018.10.012_br0220","series-title":"15th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP)","first-page":"157","article-title":"Reasoning about higher-order relational specifications","author":"Wang","year":"2013"},{"key":"10.1016\/j.entcs.2018.10.012_br0230","series-title":"Postproceedings of the 12th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2017)","article-title":"Mechanizing linear logic in Coq","author":"Xavier","year":"2018"},{"key":"10.1016\/j.entcs.2018.10.012_br0240","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1017\/S0960129514000425","article-title":"On quantum lambda calculi: a foundational perspective","volume":"26","author":"Zorzi","year":"2016","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066118300781?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066118300781?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T16:50:00Z","timestamp":1540918200000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066118300781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":24,"alternative-id":["S1571066118300781"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2018.10.012","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}