Quine (computing)

Short description: Self-replicating program

A quine's output is exactly the same as its source code (the syntax highlighting demonstrated by the text editor in the upper half of the image does not affect the output of the quine).

A quine is a computer program which takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs".

A quine is a fixed point of an execution environment, when that environment is viewed as a function transforming programs into their outputs. Quines are possible in any Turing-complete programming language, as a direct consequence of Kleene's recursion theorem. For amusement, programmers sometimes attempt to develop the shortest possible quine in any given programming language.

## Contents

* 1 Name
* 2 History
* 3 Examples
* 3.1 Constructive quines
* 3.2 Eval quines
* 3.3 "Cheating" quines
* 3.3.1 Self-evaluation
* 3.3.2 Source code inspection
* 3.3.3 Empty quines
* 4 Ouroboros programs
* 4.1 Example
* 5 Multiquines
* 6 Polyglot
* 7 Radiation-hardened
* 8 See also
* 9 Notes
* 10 References
* 11 Further reading
* 12 External links

## Name

The name "quine" was coined by Douglas Hofstadter, in his popular science book Gödel, Escher, Bach, in honor of philosopher Willard Van Orman Quine (1908–2000), who made an extensive study of indirect self-reference, and in particular for the following paradox-producing expression, known as Quine's paradox:

> "Yields falsehood when preceded by its quotation" yields falsehood when preceded by its quotation.

## History

The idea of self-reproducing automata came from the dawn of computing, if not before. John von Neumann theorized about them in the 1940s. Later, Paul Bratley and Jean Millo's article "Computer Recreations: Self-Reproducing Automata" discussed them in 1972.[1] Bratley first became interested in self-reproducing programs after seeing the first known such program written in Atlas Autocode at Edinburgh in the 1960s by the University of Edinburgh lecturer and researcher Hamish Dewar.

The "download source" requirement of the Affero General Public License is based on the idea of a quine.[2]

## Examples

### Constructive quines

In general, the method used to create a quine in any programming language is to have, within the program, two pieces: (a) code used to do the actual printing and (b) data that represents the textual form of the code. The code functions by using the data to print the code (which makes sense since the data represents the textual form of the code), but it also uses the data, processed in a simple way, to print the textual representation of the data itself.

Here are three small examples in Python 3:

# Example A. chr(39) == "'".
a = 'a = {}{}{}; print(a.format(chr(39), a, chr(39)))'; print(a.format(chr(39), a, chr(39)))

# Example B. chr(39) == "'".
b = 'b = %s%s%s; print(b %% (chr(39), b, chr(39)))'; print(b % (chr(39), b, chr(39)))

# Example C. %r will quote automatically.
c = 'c = %r; print(c %% c)'; print(c % c)

The following Java code demonstrates the basic structure of a quine.

public class Quine

public static void main(String[] args)

char q = 34;      // Quotation mark character
String[] l = {    // Array of source code
"public class Quine",
"{",
"  public static void main(String[] args)",
"  {",
"    char q = 34;      // Quotation mark character",
"    String[] l = {    // Array of source code",
"    ",
"    };",
"    for (int i = 0; i < 6; i++)           // Print opening code",
"        System.out.println(l[i]);",
"    for (int i = 0; i < l.length; i++)    // Print string array",
"        System.out.println(l[6] + q + l[i] + q + ',');",
"    for (int i = 7; i < l.length; i++)    // Print this code",
"        System.out.println(l[i]);",
"  }",
"}",

for (int i = 0; i < 6; i++)           // Print opening code
System.out.println(l[i]);
for (int i = 0; i < l.length; i++)    // Print string array
System.out.println(l[6] + q + l[i] + q + ',');
for (int i = 7; i < l.length; i++)    // Print this code
System.out.println(l[i]);

The source code contains a string array of itself, which is output twice, once inside quotation marks.

This code was adapted from an original post from c2.com, where the author, Jason Wilson, posted it as a minimalistic version of a Quine, without Java comments.[3]

Thanks to new text blocks feature in Java 15 (or newer), a more readable and simpler version is possible:[4]

public class Quine {
public static void main(String[] args) {
String textBlockQuotes = new String(new char[]{'"', '"', '"'});
char newLine = 10;
String source = """
public class Quine {
public static void main(String[] args) {
String textBlockQuotes = new String(new char[]{'"', '"', '"'});
char newLine = 10;
String source = %s;
System.out.print(source.formatted(textBlockQuotes + newLine + source + textBlockQuotes));

""";
System.out.print(source.formatted(textBlockQuotes + newLine + source + textBlockQuotes));

### Eval quines

Some programming languages have the ability to evaluate a string as a program. Quines can take advantage of this feature. For example, this Ruby quine:

eval s="print 'eval s=';p s"

Lua can do:

s="print(string.format('s=%c%s%c; load(s)()',34,s,34))"; load(s)()

In Python 3.8:

exec(s:='print("exec(s:=%r)"%s)')

### "Cheating" quines

#### Self-evaluation

In many functional languages, including Scheme and other Lisps, and interactive languages such as APL, numbers are self-evaluating. In TI-BASIC, if the last line of a program returns a value, the returned value is displayed on the screen. Therefore, in such languages a program consisting of only a single digit results in a 1-byte quine. Since such code does not construct itself, this is often considered cheating.

Other questionable techniques include making use of compiler messages; for example, in the GW-BASIC environment, entering "Syntax Error" will cause the interpreter to respond with "Syntax Error".

#### Source code inspection

Quines, per definition, cannot receive any form of input, including reading a file, which means a quine is considered to be "cheating" if it looks at its own source code. The following shell script is not a quine:

#!/bin/sh
# Invalid quine.
# Reading the executed file from disk is cheating.
cat $0

A shorter variant, exploiting the behaviour of shebang directives:

#!/bin/cat

#### Empty quines

In some languages, particularly scripting languages but also C, an empty source file is a fixed point of the language, being a valid program that produces no output.[lower-alpha 1] Calling an empty file a quine is often considered cheating.

Such an empty program, submitted as "the world's smallest self reproducing program", once won the "worst abuse of the rules" prize in the International Obfuscated C Code Contest.[5] The program was not actually compiled, but used `cp` to copy the file into another file, which could be executed to print nothing.[6]

## Ouroboros programs

The quine concept can be extended to multiple levels of recursion, giving rise to "ouroboros programs", or quine-relays. This should not be confused with multiquines.

### Example

This Java program outputs the source for a C++ program that outputs the original Java code.

#include <iostream>
#include <string>
using namespace std;

int main(int argc, char* argv[])

char q = 34;
string l[] = {
"    ",
"=============<<<<<<<< C++ Code >>>>>>>>=============",
"#include <iostream>",
"#include <string>",
"using namespace std;",
"",
"int main(int argc, char* argv[])",
"{",
"    char q = 34;",
"    string l[] = {",
"    };",
"    for(int i = 20; i <= 25; i++)",
"        cout << l[i] << endl;",
"    for(int i = 0; i <= 34; i++)",
"        cout << l[0] + q + l[i] + q + ',' << endl;",
"    for(int i = 26; i <= 34; i++)",
"        cout << l[i] << endl;",
"    return 0;",
"}",
"=============<<<<<<<< Java Code >>>>>>>>=============",
"public class Quine",
"{",
"  public static void main(String[] args)",
"  {",
"    char q = 34;",
"    String[] l = {",
"    };",
"    for(int i = 2; i <= 9; i++)",
"        System.out.println(l[i]);",
"    for(int i = 0; i < l.length; i++)",
"        System.out.println(l[0] + q + l[i] + q + ',');",
"    for(int i = 10; i <= 18; i++)",
"        System.out.println(l[i]);",
"  }",
"}",

for(int i = 20; i <= 25; i++)
cout << l[i] << endl;
for(int i = 0; i <= 34; i++)
cout << l[0] + q + l[i] + q + ',' << endl;
for(int i = 26; i <= 34; i++)
cout << l[i] << endl;
return 0;

public class Quine

public static void main(String[] args)

char q = 34;
String[] l = {
"    ",
"=============<<<<<<<< C++ Code >>>>>>>>=============",
"#include <iostream>",
"#include <string>",
"using namespace std;",
"",
"int main(int argc, char* argv[])",
"{",
"    char q = 34;",
"    string l[] = {",
"    };",
"    for(int i = 20; i <= 25; i++)",
"        cout << l[i] << endl;",
"    for(int i = 0; i <= 34; i++)",
"        cout << l[0] + q + l[i] + q + ',' << endl;",
"    for(int i = 26; i <= 34; i++)",
"        cout << l[i] << endl;",
"    return 0;",
"}",
"=============<<<<<<<< Java Code >>>>>>>>=============",
"public class Quine",
"{",
"  public static void main(String[] args)",
"  {",
"    char q = 34;",
"    String[] l = {",
"    };",
"    for(int i = 2; i <= 9; i++)",
"        System.out.println(l[i]);",
"    for(int i = 0; i < l.length; i++)",
"        System.out.println(l[0] + q + l[i] + q + ',');",
"    for(int i = 10; i <= 18; i++)",
"        System.out.println(l[i]);",
"  }",
"}",

for(int i = 2; i <= 9; i++)
System.out.println(l[i]);
for(int i = 0; i < l.length; i++)
System.out.println(l[0] + q + l[i] + q + ',');
for(int i = 10; i <= 18; i++)
System.out.println(l[i]);

Such programs have been produced with various cycle lengths:

* Haskell → Python → Ruby[7]
* Python → Bash → Perl[8]
* C → Haskell → Python → Perl[9]
* Haskell → Perl → Python → Ruby → C → Java[10]
* Ruby → Java → C# → Python[11]
* C → C++ → Ruby → Python → PHP → Perl[12]
* Ruby → Python → Perl → Lua → OCaml → Haskell → C → Java → Brainfuck → Whitespace → Unlambda[13]
* Ruby → Scala → Scheme → Scilab → Shell (bash) → S-Lang → Smalltalk → Squirrel3 → Standard ML → ... → Rexx (128 (and formerly 50) programming languages)[14]
* Web application → C (web application source code consists of HTML, JavaScript, and CSS)[15]

## Multiquines

David Madore, creator of Unlambda, describes multiquines as follows:[16]

> "A multiquine is a set of r different programs (in r different languages – without this condition we could take them all equal to a single quine), each of which is able to print any of the r programs (including itself) according to the command line argument it is passed. (Cheating is not allowed: the command line arguments must not be too long – passing the full text of a program is considered cheating)."

A multiquine consisting of 2 languages (or biquine) would be a program which:

* When run, is a quine in language X.
* When supplied with a user-defined command line argument, would print a second program in language Y.
* Given the second program in language Y, when run normally, would also be a quine in language Y.
* Given the second program in language Y, and supplied with a user-defined command line argument, would produce the original program in language X.

A biquine could then be seen as a set of two programs, both of which are able to print either of the two, depending on the command line argument supplied.

Theoretically, there is no limit on the number of languages in a multiquine. A 5-part multiquine (or pentaquine) has been produced with Python, Perl, C, NewLISP, and F#[17] and there is also a 25-language multiquine.[18]

## Polyglot

Similar to, but unlike a multiquine, a polyglot program is a computer program or script written in a valid form of multiple programming languages or file formats by combining their syntax. A polyglot program is not required to have a self-reproducing quality, although a polyglot program can also be a quine in one or more of its possible ways to execute.

Unlike quines and multiquines, polyglot programs are not guaranteed to exist between arbitrary sets of languages as a result of Kleene's recursion theorem, because they rely on the interplay between the syntaxes, and not a provable property that one can always be embedded within another.

## Radiation-hardened

A radiation-hardened quine is a quine that can have any single character removed and still produces the original program with no missing character. Of necessity, such quines are much more convoluted than ordinary quines, as is seen by the following example in Ruby:[19]

eval='eval$q=%q(puts %q(10210/#{1 1 if 1==21}}/.i rescue##/

1 1"[13,213].max_by{|s|s.size}#"##").gsub(/\d/){["=\47eval$q=%q(#$q)#\47##\47

",:eval,:instance_,"||=9"][eval$&]}
exit)#'##'

instance_eval='eval$q=%q(puts %q(10210/#{1 1 if 1==21}}/.i rescue##/

1 1"[13,213].max_by{|s|s.size}#"##").gsub(/\d/){["=\47eval$q=%q(#$q)#\47##\47

",:eval,:instance_,"||=9"][eval$&]}
exit)#'##'

/#{eval eval if eval==instance_eval}}/.i rescue##/

eval eval"[eval||=9,instance_eval||=9].max_by{|s|s.size}#"##"

## See also

* Diagonal lemma
* Droste effect
* Fixed point combinator
* Self-modifying code
* Self-interpreter
* Self-replicating machine
* Self-replication
* Self-relocation
* TiddlyWiki
* Tupper's self-referential formula
* Programming languages
* Quine's paradox
* Polyglot (computing)

## Notes

1. ↑ Examples include Bash, Perl, and Python

## References

1. ↑ Bratley, Paul; Millo, Jean (1972). "Computer Recreations: Self-Reproducing Automata". Software: Practice and Experience 2 (4): 397–400. doi:10.1002/spe.4380020411.
2. ↑ Kuhn, Bradley M. (November 21, 2007). "stet and AGPLv3". Software Freedom Law Center. http://www.softwarefreedom.org/technology/blog/2007/nov/21/stet-and-agplv3/.
3. ↑ "Quine Program". http://wiki.c2.com/?QuineProgram.
4. ↑ "Simple Java quine, self replicating (Self copying) Java code, with text blocks. This code can be run with Java 15+ or Java 13+ with special flags. License is public domain, no rights reserved". https://gist.github.com/destan/c0db5a237e9875a56141403aaa6cb9c7.
5. ↑ "IOCCC 1994 Worst Abuse of the Rules". http://www0.us.ioccc.org/1994/smr.hint.
6. ↑ "Makefile". http://www0.us.ioccc.org/1994/Makefile.
7. ↑ Dan Piponi (5 February 2008). "A Third Order Quine in Three Languages". http://blog.sigfpe.com/2008/02/third-order-quine-in-three-languages.html.
8. ↑ Bruce Ediger. "Ask and ye shall receive: Self-replicating program that goes through three generations, Python, Bash, Perl". http://www.stratigery.com/source.html#Ouroboros.
9. ↑ b.m. (1 February 2011). "multiquine". http://hpaste.org/43501/multiquine.
10. ↑ Dan Piponi (30 January 2011). "Quine Central". http://blog.sigfpe.com/2011/01/quine-central.html.
11. ↑ Ruslan Ibragimov (20 April 2013). "Quine Ruby -> Java -> C# -> Python" (in ru). http://ruslan.ibragimov.by/20-04-2013.quine-ruby-java-c-python.
12. ↑ Shinichiro Hamaji (10 November 2007). "Quine by shinh (C C++ Ruby Python PHP Perl)". http://golf.shinh.org/reveal.rb?Quine/shinh+(C+C+++Ruby+Python+PHP+Perl)_1194650418&rb. (this one is also a polyglot)
13. ↑ Ku-ma-me (22 September 2009). "Uroboros Programming With 11 Programming Languages". http://asiajin.com/blog/2009/09/22/uroboros-programming-with-11-programming-languages/.
14. ↑ Yusuke Endoh (2 November 2021). "Quine Relay - An uroboros program with 100+ programming languages". https://github.com/mame/quine-relay.
15. ↑ Michael Wehar (10 November 2019). "C Prints JavaScript" (in en). http://michaelwehar.com/quines/c_prints_javascript.html.
16. ↑ David Madore. "Quines (self-replicating programs)". http://www.madore.org/~david/computers/quine.html.
17. ↑ Rijnard van Tonder (14 January 2020). "Pentaquine - 5 part multiquine". https://github.com/rvantonder/pentaquine.
18. ↑ Lu Wang (21 May 2021). "Quine Chameleon#Variants". https://github.com/coolwanglu/quine-chameleon#variants.
19. ↑ Yusuke Endoh. "Radiation-hardened Quine". https://github.com/mame/radiation-hardened-quine.

## Further reading

* Douglas Hofstadter: Gödel, Escher, Bach: An Eternal Golden Braid
* Ken Thompson: "Reflections on Trusting Trust" (Communications of the ACM, 27(8):761-3)

## External links

* TiddlyWiki, a quine manifested as a wiki
* The Quine Page (by Gary P. Thompson)
* A Brief Guide to Self-Referential Programs
* QuineProgram at the Portland Pattern Repository Wiki
* David Madore's Discussion of Quines
* Zip File Quine
* Zip Files All The Way Down
* An Introduction to Quines — in particular, quines using more than one language
* Quine Web Page: A standards-conforming HTML+JavaScript web page that shows its own source code
* HTML Quine: An HTML page that only uses HTML and CSS to show its own source code
* Quine Challenge for Tom's JavaScript Machine, with a series of interactive hints
* A Java Quine built straight from Kleene's fixed point theorem, composition and s-n-m
* A QR code quine

* v
* t
* e

Standard test items

* Pangram
* Reference implementation
* Sanity check
* Standard test image

Artificial intelligence|

* Chinese room
* Turing test

Television (test card)|

* SMPTE color bars
* Indian-head test pattern
* Test Card F
* Philips PM5544

Computer languages|

* "Hello, World!" program
* Quine
* Trabb Pardo–Knuth algorithm
* Man or boy test
* Just another Perl hacker

Data compression|

* Calgary corpus
* Canterbury corpus

3D computer graphics|

* Cornell box
* Stanford bunny
* Stanford dragon
* Utah teapot

Machine learning|

* ImageNet
* MNIST database
* List

Typography|

* Hamburgevons
* Lorem ipsum
* The quick brown fox jumps over the lazy dog

Other|

* EICAR test file
* GTUBE
* Harvard sentences
* Lenna
* "The North Wind and the Sun"
* "Tom's Diner"
* SMPTE universal leader
* EURion constellation
* Shakedown

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Quine (computing). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Quine_(computing)&oldid=232036"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template