{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:36Z","timestamp":1706649036610},"reference-count":13,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2013,1,1]]},"DOI":"10.1215\/00294527-1731380","type":"journal-article","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T14:15:27Z","timestamp":1355494527000},"source":"Crossref","is-referenced-by-count":0,"title":["The First-Order Syntax of Variadic Functions"],"prefix":"10.1215","volume":"54","author":[{"given":"Samuel","family":"Alexander","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"3","unstructured":"[3] Bauer, A., \u201cThe hydra game,\u201d 2008, <a href=\"http:\/\/math.andrej.com\/2008\/02\/02\/the-hydra-game\/\">http:\/\/math.andrej.com\/2008\/02\/02\/the-hydra-game\/<\/a>"},{"key":"12","unstructured":"[12] Sozeau, M., \u201cProgram,\u201d Chapter 22 in <i>The Coq Proof Assistant Reference Manual<\/i>, version 8.3, available at <a href=\"http:\/\/coq.inria.fr\/doc\/index.html\">http:\/\/coq.inria.fr\/doc\/index.html<\/a> (accessed October 16, 2012)."},{"key":"1","unstructured":"[1] Alexander, S., \u201cOn guessing whether a sequence has a certain property,\u201d <i>Journal of Integer Sequences<\/i>, vol. 14 (2011), no. 11.4.4."},{"key":"2","unstructured":"[2] Alexander, S., \u201cMechanization of the first-order syntax of variadic functions in Coq,\u201d letter to the referees of this paper, December 2011."},{"key":"4","unstructured":"[4] Byrd, W., and D. Friedman, \u201cFrom variadic functions to variadic relations: A miniKanren perspective,\u201d pp. 105\u2013117 in <i>Scheme and Functional Programming (Portland, Ore., 2006)<\/i>, University of Chicago Technical Report TR-2006-06, University of Chicago Department of Computer Science, Chicago, 2006."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Dehornoy, P., \u201cBraids and Self-Distributivity,\u201d vol. 192 of <i>Progress in Mathematics<\/i>, Birkh\u00e4user, Basel, 2000.","DOI":"10.1007\/978-3-0348-8442-6"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Frink, O., \u201cSymmetric and self-distributive systems,\u201d <i>American Mathematical Monthly<\/i>, vol. 62 (1955), pp. 697\u2013707.","DOI":"10.1080\/00029890.1955.11988725"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Goldberg, M., \u201cA variadic extension of Curry\u2019s fixed-point combinator,\u201d <i>Higher Order Symbolic Computation<\/i>, vol. 18 (2005), pp. 371\u201388.","DOI":"10.1007\/s10990-005-4881-8"},{"key":"8","unstructured":"[8] Hur, C., \u201cRe: Program Fixpoints not unfolding correctly,\u201d email to the Coq-Club mailing list, 2011."},{"key":"9","unstructured":"[9] Hur, C., personal correspondence, November 2011."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Kirby, L., and J. Paris, \u201cAccessible independence results for Peano arithmetic,\u201d <i>Bulletin of the London Mathematical Society<\/i>, vol. 14 (1982), pp. 285\u201393.","DOI":"10.1112\/blms\/14.4.285"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] O\u2019Connor, R., \u201cEssential incompleteness of arithmetic verified by Coq,\u201d pp. 245\u201360 in <i>Theorem Proving in Higher Order Logics<\/i>, vol. 3603 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2005.","DOI":"10.1007\/11541868_16"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Vanden Boom, M., \u201cThe effective Borel hierarchy,\u201d <i>Fundamenta Mathematicae<\/i>, vol. 195 (2007), pp. 269\u201389.","DOI":"10.4064\/fm195-3-4"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1731380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:58:01Z","timestamp":1706648281000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-54\/issue-1\/The-First-Order-Syntax-of-Variadic-Functions\/10.1215\/00294527-1731380.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":13,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1731380","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}