<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=108.162.231.13</id>
		<title>explain xkcd - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=108.162.231.13"/>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php/Special:Contributions/108.162.231.13"/>
		<updated>2026-06-26T21:18:38Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=Talk:1312:_Haskell&amp;diff=56528</id>
		<title>Talk:1312: Haskell</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=Talk:1312:_Haskell&amp;diff=56528"/>
				<updated>2014-01-03T17:03:30Z</updated>
		
		<summary type="html">&lt;p&gt;108.162.231.13: reorder comments by timestamp, reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;quot;Thus, it is possible to have a variable representing the entire infinite list of Fibonacci numbers.&amp;quot;&lt;br /&gt;
Except that Haskell has no variables- nothing is mutable, as they say. You could certainly write a function that generates an infinite list of Fibonacci numbers when called (and lazily evaluated later), but it won't be bound to a variable. If it was, then the list would take up an infinite amount of memory, and lazy evaluation would be pointless.&lt;br /&gt;
&lt;br /&gt;
I will, however, leave the above word &amp;quot;variable&amp;quot; in the explanation, because I can't come up with a concise way of explaining the above.&lt;br /&gt;
--[[User:Someone Else 37|Someone Else 37]] ([[User talk:Someone Else 37|talk]]) 09:07, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
:&amp;quot;Expression?&amp;quot; I don't know Haskel, but that's what I would call it in another functional language. --[[User:Rael|Rael]] ([[User talk:Rael|talk]]) 16:31, 3 January 2014 (UTC)&lt;br /&gt;
::That's a little imprecise, as it doesn't capture the idea of binding a value to a single symbol.  [[Special:Contributions/108.162.231.13|108.162.231.13]] 17:03, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
:The sentence you quote is entirely correct...  but might itself require further explanation!&lt;br /&gt;
:*Haskell variables aren't mutable, but they are nonetheless referred to as &amp;quot;variables&amp;quot;.  It's an appeal to the (earlier, after all) use of the word in maths, rather than in imperative programming languages.  (No shortage of variables in algebra, geometry, calculus, topology...  And no mutation involved.)  One might equally say &amp;quot;symbol&amp;quot;, &amp;quot;constant&amp;quot;, or indeed &amp;quot;symbolic constant&amp;quot;.&lt;br /&gt;
:*One can bind the fibonaccis to a variable (... constant, 0-place definition, etc) quite happily.  In fact, that's the idiomatic way to do it, as it avoids the degenerate complexity of a naive recursive function.  It's still evaluated lazily, all the same.  (Meaning that it will take an infinite amount of memory...  if you run it for an infinite amount of time, and never &amp;quot;consume&amp;quot; the result in any way.)&lt;br /&gt;
:*Equally, one can regard such top-level symbol definitions as functions with no arguments, if that's more helpful.  [[Special:Contributions/108.162.231.13|108.162.231.13]] 16:42, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
Does anyone have a clue what the Incomplete flag refers to? This seems like a pretty good explanation to me. --[[User:Mynotoar|Mynotoar]] ([[User talk:Mynotoar|talk]]) 11:22, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
Example programs written in Haskell are: pandoc, universal markup converter; git-annex, tool to manage large files in git DVCS. --[[User:JakubNarebski|JakubNarebski]] ([[User talk:JakubNarebski|talk]]) 11:37, 3 January 2014 (UTC)&lt;/div&gt;</summary>
		<author><name>108.162.231.13</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=Talk:1312:_Haskell&amp;diff=56527</id>
		<title>Talk:1312: Haskell</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=Talk:1312:_Haskell&amp;diff=56527"/>
				<updated>2014-01-03T16:42:06Z</updated>
		
		<summary type="html">&lt;p&gt;108.162.231.13: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;quot;Thus, it is possible to have a variable representing the entire infinite list of Fibonacci numbers.&amp;quot;&lt;br /&gt;
Except that Haskell has no variables- nothing is mutable, as they say. You could certainly write a function that generates an infinite list of Fibonacci numbers when called (and lazily evaluated later), but it won't be bound to a variable. If it was, then the list would take up an infinite amount of memory, and lazy evaluation would be pointless.&lt;br /&gt;
&lt;br /&gt;
I will, however, leave the above word &amp;quot;variable&amp;quot; in the explanation, because I can't come up with a concise way of explaining the above.&lt;br /&gt;
--[[User:Someone Else 37|Someone Else 37]] ([[User talk:Someone Else 37|talk]]) 09:07, 3 January 2014 (UTC)&lt;br /&gt;
:The sentence you quote is entirely correct...  but might itself require further explanation!&lt;br /&gt;
:*Haskell variables aren't mutable, but they are nonetheless referred to as &amp;quot;variables&amp;quot;.  It's an appeal to the (earlier, after all) use of the word in maths, rather than in imperative programming languages.  (No shortage of variables in algebra, geometry, calculus, topology...  And no mutation involved.)  One might equally say &amp;quot;symbol&amp;quot;, &amp;quot;constant&amp;quot;, or indeed &amp;quot;symbolic constant&amp;quot;.&lt;br /&gt;
:*One can bind the fibonaccis to a variable (... constant, 0-place definition, etc) quite happily.  In fact, that's the idiomatic way to do it, as it avoids the degenerate complexity of a naive recursive function.  It's still evaluated lazily, all the same.  (Meaning that it will take an infinite amount of memory...  if you run it for an infinite amount of time, and never &amp;quot;consume&amp;quot; the result in any way.)&lt;br /&gt;
:*Equally, one can regard such top-level symbol definitions as functions with no arguments, if that's more helpful.  [[Special:Contributions/108.162.231.13|108.162.231.13]] 16:42, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
:&amp;quot;Expression?&amp;quot; I don't know Haskel, but that's what I would call it in another functional language. --[[User:Rael|Rael]] ([[User talk:Rael|talk]]) 16:31, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
Does anyone have a clue what the Incomplete flag refers to? This seems like a pretty good explanation to me. --[[User:Mynotoar|Mynotoar]] ([[User talk:Mynotoar|talk]]) 11:22, 3 January 2014 (UTC)&lt;br /&gt;
&lt;br /&gt;
Example programs written in Haskell are: pandoc, universal markup converter; git-annex, tool to manage large files in git DVCS. --[[User:JakubNarebski|JakubNarebski]] ([[User talk:JakubNarebski|talk]]) 11:37, 3 January 2014 (UTC)&lt;/div&gt;</summary>
		<author><name>108.162.231.13</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=1308:_Christmas_Lights&amp;diff=55917</id>
		<title>1308: Christmas Lights</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=1308:_Christmas_Lights&amp;diff=55917"/>
				<updated>2013-12-25T11:38:13Z</updated>
		
		<summary type="html">&lt;p&gt;108.162.231.13: Removed some errors and changed the bit about the star in the tree because it's not a global tradition to put a star on top&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{comic&lt;br /&gt;
| number    = 1308&lt;br /&gt;
| date      = December 25, 2013&lt;br /&gt;
| title     = Christmas Lights&lt;br /&gt;
| image     = christmas_lights.png&lt;br /&gt;
| titletext = Merry Christmas from xkcd!&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
==Explanation==&lt;br /&gt;
{{incomplete|Check grammar and add details about the star spectrum}}&lt;br /&gt;
Understanding this comic requires knowing about electromagnetic spectra.&lt;br /&gt;
In a nutshell, an electromagnetic spectrum is the scientific way of representing the amounts and type of radiation than a specific source emits. In this comic appears a subtype of these, a light spectrum, that shows the visible radiation, some infrared and some ultraviolet. More detailed info on wikipedia({{w|Electromagnetic spectrum}}).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
There are 4 graphs in this comic:&lt;br /&gt;
&lt;br /&gt;
In the center of the image, between the couple Cueball and Megan and Beret Guy appears a light spectrum of a fire, notably because it emits a lot of energy in the infrared band (The left zone of the spectrum), and in the red and orange zone (typical colors of a fire)&lt;br /&gt;
&lt;br /&gt;
In the right of the comic appear some spectra shaped in the form of a Christmas tree. There are 3 different spectra in this &amp;quot;Christmas tree&amp;quot;:&lt;br /&gt;
&lt;br /&gt;
In the top appears a complex spectrum, probably that of a white LED (see [http://led-brdf.wikispaces.com/Introduction+to+LEDs here]), representing the tradition in some countries of putting a star in the top of the Christmas tree, which represents the star that guided the Three Wise Men in Christianity.&lt;br /&gt;
&lt;br /&gt;
In the branches there are two simpler spectra, one with a peak in the green zone, representing a green LED, and other with a peak in the red zone, representing a red LED.&lt;br /&gt;
&lt;br /&gt;
==Transcript==&lt;br /&gt;
{{incomplete transcript}}&lt;br /&gt;
&lt;br /&gt;
{{comic discussion}}&lt;br /&gt;
[[Category:Comics featuring Megan]]&lt;br /&gt;
[[Category:Comics featuring Cueball]]&lt;br /&gt;
[[Category:Comics featuring Beret Guy]]&lt;br /&gt;
[[Category:Comics with color]]&lt;/div&gt;</summary>
		<author><name>108.162.231.13</name></author>	</entry>

	</feed>