Wiktionary data extraction errors and warnings

• Home
• English edition
• Diagnostics
• Debug messages
• Debug messages subpage 2555
• quine/English/noun

quine/English/noun

• 1: quine/English/noun: 'word' should be a non-empty string (it is a mandatory field): {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}: {"categories": ["English adjectives", "English coinages", "English countable nouns", "English entries with incorrect language header", "English eponyms", "English learned borrowings from Latin", "English lemmas", "English nouns", "English terms borrowed from Latin", "English terms coined by Daniel Dennett", "English terms coined by Douglas Hofstadter", "English terms derived from Latin", "English terms derived from Proto-Indo-European", "English terms derived from the Proto-Indo-European word *pénkʷe", "English transitive verbs", "English uncomparable adjectives", "English verbs", "Entries with translation boxes", "Pages with 5 entries", "Pages with entries", "Rhymes:English/aɪn", "Rhymes:English/aɪn/1 syllable", "Terms with Finnish translations", "en:Five"], "etymology_number": 1, "etymology_templates": [{"args": {"1": "logician and philosopher", "2": "", "3": "", "4": "", "5": ""}, "expansion": "logician and philosopher", "name": "named-after/list"}, {"args": {}, "expansion": "|", "name": "!"}, {"args": {"1": "en", "2": "Willard Van Orman Quine"}, "expansion": "Willard Van Orman Quine", "name": "lang"}, {"args": {"1": "en", "2": "Willard Van Orman Quine", "born": "1908", "died": "2000", "nat": "the American", "nocap": "1", "occ": "logician and philosopher", "wplink": "="}, "expansion": "named after the American logician and philosopher Willard Van Orman Quine (1908–2000)", "name": "named-after"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "append"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en", "2": "Douglas Hofstadter", "nat": "the American", "nocap": "1", "occ": "cognitive and computer scientist"}, "expansion": "coined by the American cognitive and computer scientist Douglas Hofstadter", "name": "coinage"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "computing"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "philosophy"}, "expansion": "sense 2", "name": "senseno"}, {"args": {"1": "en", "2": "Daniel Dennett", "nat": "the American", "nocap": "1", "occ": "cognitive scientist and philosopher"}, "expansion": "coined by the American cognitive scientist and philosopher Daniel Dennett", "name": "coinage"}], "etymology_text": "From Quine, named after the American logician and philosopher Willard Van Orman Quine (1908–2000).\nVerb sense 1 (“to append (a text) to a quotation of itself”) was coined by the American cognitive and computer scientist Douglas Hofstadter (born 1945) in his book Gödel, Escher, Bach: An Eternal Golden Braid (1979; see the quotation), referring to Quine’s study of indirect self-referencing and in particular Quine’s paradox, the following statement that produces a paradox: “‘Yields falsehood when preceded by its quotation’ yields falsehood when preceded by its quotation.” Hofstadter also referred to the concept of noun sense 1 (“program that produces its own source code as output”) in the book, but termed it a self-rep rather than a quine.\nVerb sense 2 (“to deny the importance or significance of (something obviously real or important)”) was independently coined by the American cognitive scientist and philosopher Daniel Dennett (1942–2024) in September 1969 in the original version of his work The Philosophical Lexicon: see the 1987 quotation.", "forms": [{"form": "quines", "tags": ["plural"]}], "head_templates": [{"args": {}, "expansion": "quine (plural quines)", "name": "en-noun"}], "lang": "English", "lang_code": "en", "pos": "noun", "related": [{"word": "Quine"}], "senses": [{"categories": ["English terms with quotations", "en:Computing"], "examples": [{"ref": "1996 October 10, John David Regehr, “[A] Quine in C++?”, in comp.lang.misc (Usenet):", "text": "This has been bugging me recently. Any quines or pointers to relevant articles or web pages is appreciated. Thanks!", "type": "quote"}, {"ref": "1999 December 14, Gergo Barany, “CC Hack?”, in comp.lang.c (Usenet):", "text": "Self-reproducing programs are commonly called quines. Do a web search, it should turn up lots of them. There was also a quine thread here in comp.lang.c just days ago, search deja.com (the thread's title was something about self-printing programs, I think).", "type": "quote"}, {"ref": "2001 July, Clinton Pierce, “Advanced Perl”, in Perl Developer’s Dictionary, Indianapolis, Ind.: Sams Publishing, →ISBN, page 269:", "text": "A quine is a program that can print its own source code. Most quines are notoriously difficult (and fiendish) to write. Perl can cheat, though. :)", "type": "quote"}, {"ref": "2003 May 6, Arthur J. O’Dwyer, “‘A to Z of C’”, in comp.lang.c (Usenet):", "text": "Why have a one-page chapter that doesn't say anything? At the least, you should present a quine program written in pure ISO C (I can send you one if you like); […] you might refer the interested reader to Ken Thompson's ACM lecture or to another good source of quine-related puzzles. Quines *are* a lot of fun, but why waste time with trivial ASCII-based examples when there are much more fundamental ways to create them?", "type": "quote"}, {"ref": "2004, David [J.] Darling, “quine”, in The Universal Book of Mathematics: From Abracadabra to Zeno’s Paradoxes, Hoboken, N.J.: John Wiley & Sons, →ISBN, page 264, column 2:", "text": "A respectable quine—one that doesn't cheat—is not allowed to do anything as underhand or trivial as seeking the source file on the disk, opening it, and copying (or printing) its contents. Although writing a quine is not always easy, and in fact may seem impossible, it can always be done in any programming language that is Turing complete (see Turing machine), which includes every programming language actually in use.", "type": "quote"}, {"ref": "2005, Simon Cozens, “Fun with Perl”, in Allison Randal, editor, Advanced Perl Programming, 2nd edition, Sebastopol, Calif.: O’Reilly Media, →ISBN, page 260:", "text": "SelfGOL can reproduce itself; it can turn other programs into a quine; it can display a scrolling banner; it plays the Game of Life; and it contains no (ordinary) loops, goto statements, or if statements. Control flow is done, well, interestingly.", "type": "quote"}, {"ref": "2008, Julian Rohrhuber, “Implications of Unfolding”, in Uwe Seifert, Jin-hyun Kim, Anthony Moore, editors, Paradoxes of Interactivity: Perspectives for Media Theory, Human-computer Interaction, and Artistic Investigations, Bielefeld, North Rhine-Westphalia: transcript Verlag, →ISBN, part II (Interplay between Art, Science, and Technology), page 179:", "text": "Yet from a different perspective, it [the semantics of a program] describes the process of producing this very code; in other words, it is because object- and meta-language interrelate that makes a quine difficult; in less reflective programs, where means and ends are more separate, this difficulty is not so obvious.", "type": "quote"}, {"ref": "2009 July 31, Mike Ash, “‘--All You Zombies--’ Title”, in rec.arts.sf.written (Usenet):", "text": "Gee, last time I wrote a quine in Lisp it ended up being kind of difficult …", "type": "quote"}, {"ref": "2011, Antoine Amarilli [et al.], “Can Code Polymorphism Limit Information Leakage?”, in Claudio Agostino Ardagna, Jianying Zhou, editors, Information Security Theory and Practice: Security and Privacy of Mobile Devices in Wireless Communication […] (Lecture Notes in Computer Science; 6633), Berlin: Springer, →ISBN, archived from the original on 2022-02-06, section 5 (Can Lisp-like Languages Help?), page 14:", "text": "The solution is to make a quine that is also a λ-expression (instead of a list of statements). This is possible, thanks to S-expressions. The way the quine works relies on the fact that its code is a list of statements and that the last one can take a list of the previous ones as arguments.", "type": "quote"}, {"ref": "2012, Thomas Meyer, Christian Tschudin, “Robust Network Services with Distributed Code Rewiring”, in Pietro Lio, Dinesh Verma, editors, Biologically Inspired Networking and Sensing: Algorithms and Architectures, Hershey, Pa.: Medical Information Science Reference, IGI Global, →ISBN, section I (New Biologically Inspired Architectures), page 37, column 1:", "text": "A Quine is a program that prints its own code. Quines exist for any programming language that is Turing complete and it is a common challenge for students to come up with a Quine in their language of choice. The Quine Page provides a comprehensive list of such programs in various languages.", "type": "quote"}, {"ref": "2013 December 8, Brian Hodgert, “‘Mountains will be Mountains’”, in talk.religion.buddhism (Usenet):", "text": "Upon receiving a \"QUINE\" request by the client, the server will first send a 01 OK response, and will then provide the client with a quine in the programming language used to implement the server. This quine does not have to be original.", "type": "quote"}], "glosses": ["A program that produces its own source code as output."], "links": [["computing", "computing#Noun"], ["program", "program#Noun"], ["produces", "produce#Verb"], ["source code", "source code"], ["output", "output#Noun"]], "raw_glosses": ["(computing) A program that produces its own source code as output."], "senseid": ["en:computing"], "topics": ["computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences"]}], "sounds": [{"ipa": "/kwaɪn/", "tags": ["General-American", "Received-Pronunciation"]}, {"audio": "LL-Q1860 (eng)-Vealhurl-quine.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.ogg"}, {"rhymes": "-aɪn"}], "translations": [{"code": "fi", "lang": "Finnish", "sense": "program that outputs its own source code", "word": "quine"}, {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}], "wikipedia": ["American Philosophical Association", "Epimenides", "Kathleen Atkins", "The Philosophical Lexicon", "indirect self-referencing"], "word": "quine"}

quine/English/noun: 'word' should be a non-empty string (it is a mandatory field): {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}: {"categories": ["English adjectives", "English coinages", "English countable nouns", "English entries with incorrect language header", "English eponyms", "English learned borrowings from Latin", "English lemmas", "English nouns", "English terms borrowed from Latin", "English terms coined by Daniel Dennett", "English terms coined by Douglas Hofstadter", "English terms derived from Latin", "English terms derived from Proto-Indo-European", "English terms derived from the Proto-Indo-European word *pénkʷe", "English transitive verbs", "English uncomparable adjectives", "English verbs", "Entries with translation boxes", "Pages with 5 entries", "Pages with entries", "Rhymes:English/aɪn", "Rhymes:English/aɪn/1 syllable", "Terms with Finnish translations", "en:Five"], "etymology_number": 1, "etymology_templates": [{"args": {"1": "logician and philosopher", "2": "", "3": "", "4": "", "5": ""}, "expansion": "logician and philosopher", "name": "named-after/list"}, {"args": {}, "expansion": "|", "name": "!"}, {"args": {"1": "en", "2": "Willard Van Orman Quine"}, "expansion": "Willard Van Orman Quine", "name": "lang"}, {"args": {"1": "en", "2": "Willard Van Orman Quine", "born": "1908", "died": "2000", "nat": "the American", "nocap": "1", "occ": "logician and philosopher", "wplink": "="}, "expansion": "named after the American logician and philosopher Willard Van Orman Quine (1908–2000)", "name": "named-after"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "append"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en", "2": "Douglas Hofstadter", "nat": "the American", "nocap": "1", "occ": "cognitive and computer scientist"}, "expansion": "coined by the American cognitive and computer scientist Douglas Hofstadter", "name": "coinage"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "computing"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "philosophy"}, "expansion": "sense 2", "name": "senseno"}, {"args": {"1": "en", "2": "Daniel Dennett", "nat": "the American", "nocap": "1", "occ": "cognitive scientist and philosopher"}, "expansion": "coined by the American cognitive scientist and philosopher Daniel Dennett", "name": "coinage"}], "etymology_text": "From Quine, named after the American logician and philosopher Willard Van Orman Quine (1908–2000).\nVerb sense 1 (“to append (a text) to a quotation of itself”) was coined by the American cognitive and computer scientist Douglas Hofstadter (born 1945) in his book Gödel, Escher, Bach: An Eternal Golden Braid (1979; see the quotation), referring to Quine’s study of indirect self-referencing and in particular Quine’s paradox, the following statement that produces a paradox: “‘Yields falsehood when preceded by its quotation’ yields falsehood when preceded by its quotation.” Hofstadter also referred to the concept of noun sense 1 (“program that produces its own source code as output”) in the book, but termed it a self-rep rather than a quine.\nVerb sense 2 (“to deny the importance or significance of (something obviously real or important)”) was independently coined by the American cognitive scientist and philosopher Daniel Dennett (1942–2024) in September 1969 in the original version of his work The Philosophical Lexicon: see the 1987 quotation.", "forms": [{"form": "quines", "tags": ["plural"]}], "head_templates": [{"args": {}, "expansion": "quine (plural quines)", "name": "en-noun"}], "lang": "English", "lang_code": "en", "pos": "noun", "related": [{"word": "Quine"}], "senses": [{"categories": ["English terms with quotations", "en:Computing"], "examples": [{"ref": "1996 October 10, John David Regehr, “[A] Quine in C++?”, in comp.lang.misc (Usenet):", "text": "This has been bugging me recently. Any quines or pointers to relevant articles or web pages is appreciated. Thanks!", "type": "quote"}, {"ref": "1999 December 14, Gergo Barany, “CC Hack?”, in comp.lang.c (Usenet):", "text": "Self-reproducing programs are commonly called quines. Do a web search, it should turn up lots of them. There was also a quine thread here in comp.lang.c just days ago, search deja.com (the thread's title was something about self-printing programs, I think).", "type": "quote"}, {"ref": "2001 July, Clinton Pierce, “Advanced Perl”, in Perl Developer’s Dictionary, Indianapolis, Ind.: Sams Publishing, →ISBN, page 269:", "text": "A quine is a program that can print its own source code. Most quines are notoriously difficult (and fiendish) to write. Perl can cheat, though. :)", "type": "quote"}, {"ref": "2003 May 6, Arthur J. O’Dwyer, “‘A to Z of C’”, in comp.lang.c (Usenet):", "text": "Why have a one-page chapter that doesn't say anything? At the least, you should present a quine program written in pure ISO C (I can send you one if you like); […] you might refer the interested reader to Ken Thompson's ACM lecture or to another good source of quine-related puzzles. Quines *are* a lot of fun, but why waste time with trivial ASCII-based examples when there are much more fundamental ways to create them?", "type": "quote"}, {"ref": "2004, David [J.] Darling, “quine”, in The Universal Book of Mathematics: From Abracadabra to Zeno’s Paradoxes, Hoboken, N.J.: John Wiley & Sons, →ISBN, page 264, column 2:", "text": "A respectable quine—one that doesn't cheat—is not allowed to do anything as underhand or trivial as seeking the source file on the disk, opening it, and copying (or printing) its contents. Although writing a quine is not always easy, and in fact may seem impossible, it can always be done in any programming language that is Turing complete (see Turing machine), which includes every programming language actually in use.", "type": "quote"}, {"ref": "2005, Simon Cozens, “Fun with Perl”, in Allison Randal, editor, Advanced Perl Programming, 2nd edition, Sebastopol, Calif.: O’Reilly Media, →ISBN, page 260:", "text": "SelfGOL can reproduce itself; it can turn other programs into a quine; it can display a scrolling banner; it plays the Game of Life; and it contains no (ordinary) loops, goto statements, or if statements. Control flow is done, well, interestingly.", "type": "quote"}, {"ref": "2008, Julian Rohrhuber, “Implications of Unfolding”, in Uwe Seifert, Jin-hyun Kim, Anthony Moore, editors, Paradoxes of Interactivity: Perspectives for Media Theory, Human-computer Interaction, and Artistic Investigations, Bielefeld, North Rhine-Westphalia: transcript Verlag, →ISBN, part II (Interplay between Art, Science, and Technology), page 179:", "text": "Yet from a different perspective, it [the semantics of a program] describes the process of producing this very code; in other words, it is because object- and meta-language interrelate that makes a quine difficult; in less reflective programs, where means and ends are more separate, this difficulty is not so obvious.", "type": "quote"}, {"ref": "2009 July 31, Mike Ash, “‘--All You Zombies--’ Title”, in rec.arts.sf.written (Usenet):", "text": "Gee, last time I wrote a quine in Lisp it ended up being kind of difficult …", "type": "quote"}, {"ref": "2011, Antoine Amarilli [et al.], “Can Code Polymorphism Limit Information Leakage?”, in Claudio Agostino Ardagna, Jianying Zhou, editors, Information Security Theory and Practice: Security and Privacy of Mobile Devices in Wireless Communication […] (Lecture Notes in Computer Science; 6633), Berlin: Springer, →ISBN, archived from the original on 2022-02-06, section 5 (Can Lisp-like Languages Help?), page 14:", "text": "The solution is to make a quine that is also a λ-expression (instead of a list of statements). This is possible, thanks to S-expressions. The way the quine works relies on the fact that its code is a list of statements and that the last one can take a list of the previous ones as arguments.", "type": "quote"}, {"ref": "2012, Thomas Meyer, Christian Tschudin, “Robust Network Services with Distributed Code Rewiring”, in Pietro Lio, Dinesh Verma, editors, Biologically Inspired Networking and Sensing: Algorithms and Architectures, Hershey, Pa.: Medical Information Science Reference, IGI Global, →ISBN, section I (New Biologically Inspired Architectures), page 37, column 1:", "text": "A Quine is a program that prints its own code. Quines exist for any programming language that is Turing complete and it is a common challenge for students to come up with a Quine in their language of choice. The Quine Page provides a comprehensive list of such programs in various languages.", "type": "quote"}, {"ref": "2013 December 8, Brian Hodgert, “‘Mountains will be Mountains’”, in talk.religion.buddhism (Usenet):", "text": "Upon receiving a \"QUINE\" request by the client, the server will first send a 01 OK response, and will then provide the client with a quine in the programming language used to implement the server. This quine does not have to be original.", "type": "quote"}], "glosses": ["A program that produces its own source code as output."], "links": [["computing", "computing#Noun"], ["program", "program#Noun"], ["produces", "produce#Verb"], ["source code", "source code"], ["output", "output#Noun"]], "raw_glosses": ["(computing) A program that produces its own source code as output."], "senseid": ["en:computing"], "topics": ["computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences"]}], "sounds": [{"ipa": "/kwaɪn/", "tags": ["General-American", "Received-Pronunciation"]}, {"audio": "LL-Q1860 (eng)-Vealhurl-quine.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.ogg"}, {"rhymes": "-aɪn"}], "translations": [{"code": "fi", "lang": "Finnish", "sense": "program that outputs its own source code", "word": "quine"}, {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}], "wikipedia": ["American Philosophical Association", "Epimenides", "Kathleen Atkins", "The Philosophical Lexicon", "indirect self-referencing"], "word": "quine"}

quine (English noun) quine/English/noun: 'word' should be a non-empty string (it is a mandatory field): {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}: {"categories": ["English adjectives", "English coinages", "English countable nouns", "English entries with incorrect language header", "English eponyms", "English learned borrowings from Latin", "English lemmas", "English nouns", "English terms borrowed from Latin", "English terms coined by Daniel Dennett", "English terms coined by Douglas Hofstadter", "English terms derived from Latin", "English terms derived from Proto-Indo-European", "English terms derived from the Proto-Indo-European word *pénkʷe", "English transitive verbs", "English uncomparable adjectives", "English verbs", "Entries with translation boxes", "Pages with 5 entries", "Pages with entries", "Rhymes:English/aɪn", "Rhymes:English/aɪn/1 syllable", "Terms with Finnish translations", "en:Five"], "etymology_number": 1, "etymology_templates": [{"args": {"1": "logician and philosopher", "2": "", "3": "", "4": "", "5": ""}, "expansion": "logician and philosopher", "name": "named-after/list"}, {"args": {}, "expansion": "|", "name": "!"}, {"args": {"1": "en", "2": "Willard Van Orman Quine"}, "expansion": "Willard Van Orman Quine", "name": "lang"}, {"args": {"1": "en", "2": "Willard Van Orman Quine", "born": "1908", "died": "2000", "nat": "the American", "nocap": "1", "occ": "logician and philosopher", "wplink": "="}, "expansion": "named after the American logician and philosopher Willard Van Orman Quine (1908–2000)", "name": "named-after"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "append"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en", "2": "Douglas Hofstadter", "nat": "the American", "nocap": "1", "occ": "cognitive and computer scientist"}, "expansion": "coined by the American cognitive and computer scientist Douglas Hofstadter", "name": "coinage"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "computing"}, "expansion": "sense 1", "name": "senseno"}, {"args": {"1": "en"}, "expansion": "English", "name": "langname"}, {"args": {"1": "en", "2": "philosophy"}, "expansion": "sense 2", "name": "senseno"}, {"args": {"1": "en", "2": "Daniel Dennett", "nat": "the American", "nocap": "1", "occ": "cognitive scientist and philosopher"}, "expansion": "coined by the American cognitive scientist and philosopher Daniel Dennett", "name": "coinage"}], "etymology_text": "From Quine, named after the American logician and philosopher Willard Van Orman Quine (1908–2000).\nVerb sense 1 (“to append (a text) to a quotation of itself”) was coined by the American cognitive and computer scientist Douglas Hofstadter (born 1945) in his book Gödel, Escher, Bach: An Eternal Golden Braid (1979; see the quotation), referring to Quine’s study of indirect self-referencing and in particular Quine’s paradox, the following statement that produces a paradox: “‘Yields falsehood when preceded by its quotation’ yields falsehood when preceded by its quotation.” Hofstadter also referred to the concept of noun sense 1 (“program that produces its own source code as output”) in the book, but termed it a self-rep rather than a quine.\nVerb sense 2 (“to deny the importance or significance of (something obviously real or important)”) was independently coined by the American cognitive scientist and philosopher Daniel Dennett (1942–2024) in September 1969 in the original version of his work The Philosophical Lexicon: see the 1987 quotation.", "forms": [{"form": "quines", "tags": ["plural"]}], "head_templates": [{"args": {}, "expansion": "quine (plural quines)", "name": "en-noun"}], "lang": "English", "lang_code": "en", "pos": "noun", "related": [{"word": "Quine"}], "senses": [{"categories": ["English terms with quotations", "en:Computing"], "examples": [{"ref": "1996 October 10, John David Regehr, “[A] Quine in C++?”, in comp.lang.misc (Usenet):", "text": "This has been bugging me recently. Any quines or pointers to relevant articles or web pages is appreciated. Thanks!", "type": "quote"}, {"ref": "1999 December 14, Gergo Barany, “CC Hack?”, in comp.lang.c (Usenet):", "text": "Self-reproducing programs are commonly called quines. Do a web search, it should turn up lots of them. There was also a quine thread here in comp.lang.c just days ago, search deja.com (the thread's title was something about self-printing programs, I think).", "type": "quote"}, {"ref": "2001 July, Clinton Pierce, “Advanced Perl”, in Perl Developer’s Dictionary, Indianapolis, Ind.: Sams Publishing, →ISBN, page 269:", "text": "A quine is a program that can print its own source code. Most quines are notoriously difficult (and fiendish) to write. Perl can cheat, though. :)", "type": "quote"}, {"ref": "2003 May 6, Arthur J. O’Dwyer, “‘A to Z of C’”, in comp.lang.c (Usenet):", "text": "Why have a one-page chapter that doesn't say anything? At the least, you should present a quine program written in pure ISO C (I can send you one if you like); […] you might refer the interested reader to Ken Thompson's ACM lecture or to another good source of quine-related puzzles. Quines *are* a lot of fun, but why waste time with trivial ASCII-based examples when there are much more fundamental ways to create them?", "type": "quote"}, {"ref": "2004, David [J.] Darling, “quine”, in The Universal Book of Mathematics: From Abracadabra to Zeno’s Paradoxes, Hoboken, N.J.: John Wiley & Sons, →ISBN, page 264, column 2:", "text": "A respectable quine—one that doesn't cheat—is not allowed to do anything as underhand or trivial as seeking the source file on the disk, opening it, and copying (or printing) its contents. Although writing a quine is not always easy, and in fact may seem impossible, it can always be done in any programming language that is Turing complete (see Turing machine), which includes every programming language actually in use.", "type": "quote"}, {"ref": "2005, Simon Cozens, “Fun with Perl”, in Allison Randal, editor, Advanced Perl Programming, 2nd edition, Sebastopol, Calif.: O’Reilly Media, →ISBN, page 260:", "text": "SelfGOL can reproduce itself; it can turn other programs into a quine; it can display a scrolling banner; it plays the Game of Life; and it contains no (ordinary) loops, goto statements, or if statements. Control flow is done, well, interestingly.", "type": "quote"}, {"ref": "2008, Julian Rohrhuber, “Implications of Unfolding”, in Uwe Seifert, Jin-hyun Kim, Anthony Moore, editors, Paradoxes of Interactivity: Perspectives for Media Theory, Human-computer Interaction, and Artistic Investigations, Bielefeld, North Rhine-Westphalia: transcript Verlag, →ISBN, part II (Interplay between Art, Science, and Technology), page 179:", "text": "Yet from a different perspective, it [the semantics of a program] describes the process of producing this very code; in other words, it is because object- and meta-language interrelate that makes a quine difficult; in less reflective programs, where means and ends are more separate, this difficulty is not so obvious.", "type": "quote"}, {"ref": "2009 July 31, Mike Ash, “‘--All You Zombies--’ Title”, in rec.arts.sf.written (Usenet):", "text": "Gee, last time I wrote a quine in Lisp it ended up being kind of difficult …", "type": "quote"}, {"ref": "2011, Antoine Amarilli [et al.], “Can Code Polymorphism Limit Information Leakage?”, in Claudio Agostino Ardagna, Jianying Zhou, editors, Information Security Theory and Practice: Security and Privacy of Mobile Devices in Wireless Communication […] (Lecture Notes in Computer Science; 6633), Berlin: Springer, →ISBN, archived from the original on 2022-02-06, section 5 (Can Lisp-like Languages Help?), page 14:", "text": "The solution is to make a quine that is also a λ-expression (instead of a list of statements). This is possible, thanks to S-expressions. The way the quine works relies on the fact that its code is a list of statements and that the last one can take a list of the previous ones as arguments.", "type": "quote"}, {"ref": "2012, Thomas Meyer, Christian Tschudin, “Robust Network Services with Distributed Code Rewiring”, in Pietro Lio, Dinesh Verma, editors, Biologically Inspired Networking and Sensing: Algorithms and Architectures, Hershey, Pa.: Medical Information Science Reference, IGI Global, →ISBN, section I (New Biologically Inspired Architectures), page 37, column 1:", "text": "A Quine is a program that prints its own code. Quines exist for any programming language that is Turing complete and it is a common challenge for students to come up with a Quine in their language of choice. The Quine Page provides a comprehensive list of such programs in various languages.", "type": "quote"}, {"ref": "2013 December 8, Brian Hodgert, “‘Mountains will be Mountains’”, in talk.religion.buddhism (Usenet):", "text": "Upon receiving a \"QUINE\" request by the client, the server will first send a 01 OK response, and will then provide the client with a quine in the programming language used to implement the server. This quine does not have to be original.", "type": "quote"}], "glosses": ["A program that produces its own source code as output."], "links": [["computing", "computing#Noun"], ["program", "program#Noun"], ["produces", "produce#Verb"], ["source code", "source code"], ["output", "output#Noun"]], "raw_glosses": ["(computing) A program that produces its own source code as output."], "senseid": ["en:computing"], "topics": ["computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "sciences"]}], "sounds": [{"ipa": "/kwaɪn/", "tags": ["General-American", "Received-Pronunciation"]}, {"audio": "LL-Q1860 (eng)-Vealhurl-quine.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/aa/LL-Q1860_%28eng%29-Vealhurl-quine.wav/LL-Q1860_%28eng%29-Vealhurl-quine.wav.ogg"}, {"rhymes": "-aɪn"}], "translations": [{"code": "fi", "lang": "Finnish", "sense": "program that outputs its own source code", "word": "quine"}, {"code": "fi", "lang": "Finnish", "note": "oman lähdekoodinsa tulostava ohjelma", "sense": "program that outputs its own source code"}], "wikipedia": ["American Philosophical Association", "Epimenides", "Kathleen Atkins", "The Philosophical Lexicon", "indirect self-referencing"], "word": "quine"}