<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ihatehumans</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ihatehumans"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/Ihatehumans"/>
	<updated>2026-10-26T02:14:46Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=United_States_of_America&amp;diff=1476649</id>
		<title>United States of America</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=United_States_of_America&amp;diff=1476649"/>
		<updated>2018-12-23T22:55:07Z</updated>

		<summary type="html">&lt;p&gt;Ihatehumans: Add some truth&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Country&lt;br /&gt;
|name           =''United States of America''&lt;br /&gt;
|map	        =US map.PNG&lt;br /&gt;
|map2           =Loc of United States.png&lt;br /&gt;
|established=1776&lt;br /&gt;
|flag	        =50 star flag.png&lt;br /&gt;
|arms	        =United States arms.png&lt;br /&gt;
|capital	=Washington, D.C.&lt;br /&gt;
|government	=Constitutional Republic&lt;br /&gt;
|language	=English&lt;br /&gt;
|official =n&lt;br /&gt;
|president	=Donald John Trump&lt;br /&gt;
|area	        =3,796,742 sq mi&lt;br /&gt;
|pop	        =325,719,178 (2017)&lt;br /&gt;
|gdp    	=$19.390 trillion (2017)&lt;br /&gt;
|gdp-year	=&lt;br /&gt;
|gdp-pc	        =$59,501 (2017)&lt;br /&gt;
|currency	=United States Dollar (USD)&lt;br /&gt;
}}&lt;br /&gt;
The '''United States of America'''&amp;lt;ref&amp;gt;(''conventional short form'': '''United States'''; ''abbreviation'': '''US''' or '''USA'''; sometimes also referred to as '''the States''' or simply as '''America''')&amp;lt;/ref&amp;gt; is a [[federal republic]]&amp;lt;ref name=&amp;quot;NotDemocracy&amp;quot;&amp;gt;Multiple references:&lt;br /&gt;
*Snowball, Timothy (October 29, 2018). [https://thehill.com/opinion/campaign/413142-the-united-states-is-not-a-democracy-and-it-wasnt-meant-to-be-one The United States is not a democracy — and it wasn't meant to be one]. ''The Hill''. Retrieved October 29, 2018.&lt;br /&gt;
*Humphrey, Clifford (February 7, 2018). [http://thefederalist.com/2018/02/07/sorry-liberals-america-not-democracy-better-way/ Sorry, Liberals, But America Is Not A Democracy, And It’s Better That Way]. ''The Federalist''. Retrieved December 13, 2018.&lt;br /&gt;
*Williams, Walter E. (January 16, 2018). [https://www.cnsnews.com/commentary/walter-e-williams/us-not-democracy The US Is Not a Democracy]. ''CNS News''. Retrieved December 13, 2018.&amp;lt;/ref&amp;gt; of fifty states, a capitol district, and fifteen territories. It is a prosperous, self-centered and relatively [[conservative]] and Christian nation, based on the longest-running [[Constitution]] in history.  Located on the [[North American]] continent, it is bound mainly by [[Canada]] to the north, [[Mexico]] to the south, the [[Pacific Ocean]] to the west, and the [[Atlantic Ocean]] to the east. Founded originally as 13 colonies in the [[British Empire]], Britain's American colonies formally broke with the mother country on July 4, 1776, with the [[Declaration of Independence]].&amp;lt;ref&amp;gt;IN CONGRESS, JULY 4, 1776. [http://www.ushistory.org/Declaration/document/index.htm The unanimous Declaration of the thirteen united States of America], ushistory.org, (Accessed August 2010).&amp;lt;/ref&amp;gt; Britain formally recognized the independence of the new nation, the United States of America, in the 1783 Treaty of Paris, which ended the [[American Revolutionary War]]. Shortly thereafter, in 1787, the [[United States Constitution]] was written; grounded on [[Republican form of government|republican]] political principles.&lt;br /&gt;
&lt;br /&gt;
The Constitution remains in effect today, albeit with several amendments since then. The Americans created political parties and, since abolishing [[slavery]] in a bloody [[American Civil War|civil war]] (1861–65), instituted a form of government guided by the rule of law rather than the desires of a majority of voters. According to the U.S. Constitution written by America's [[Founding Fathers]], the United States is a [[Constitutional Republic]] that functions as a representative [[democracy]]. America derives many of its policies from Christian Principles and the logic behind the Bible(See the section on ''Natural Law''). Many people view America as holding a special place among nations, due to its foundations in liberty and justice. &lt;br /&gt;
&lt;br /&gt;
America's [[free market]] economy grew rapidly, becoming the largest in the world by the 1870s. Between 1791 and 1959, 37 new states were added to the original 13 as the nation expanded across the North American continent and acquired a number of overseas possessions. After defeating the Soviet Union in the [[Cold War]], the U.S. emerged as the world's only [[superpower]], having the largest economy and most powerful military. It exerts enormous cultural and intellectual influence worldwide, and in return is the target of the enemies of democracy and [[capitalism]].&lt;br /&gt;
&lt;br /&gt;
The capital of the United States of America is [[Washington, DC]].&lt;br /&gt;
&lt;br /&gt;
== People ==&lt;br /&gt;
[[File:Php3sfokfPM.jpg|225px|left|At Washington, DC.]]&lt;br /&gt;
Population: 321,634,000 (2015 est.)&amp;lt;ref&amp;gt;2016 ''Britannica Book of the Year''.&amp;lt;/ref&amp;gt;&lt;br /&gt;
Population growth rate: 0.97% (2010 est.) Labor force:	153.9 million (2010 est.).&lt;br /&gt;
&lt;br /&gt;
Ethnic groups: white 79.96%, black 12.85%, Asian 4.43%, Amerindian and Alaska native 0.97%, native Hawaiian and other Pacific Islander 0.18%, two or more races 1.61% (July 2007 estimate) note: a separate listing for Hispanic is not included because the US Census Bureau considers Hispanic to mean persons of Spanish/Hispanic/Latino origin including those of Mexican, Cuban, Puerto Rican, Dominican Republic, Spanish, and Central or South American origin living in the US who may be of any race or ethnic group (white, black, Asian, etc.); about 15.1% of the total US population is Hispanic &amp;lt;ref&amp;gt;[https://www.cia.gov/library/publications/the-world-factbook/geos/us.html CIA - The World Factbook.]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In 2010, around 400,000 [[illegal immigrants]] were deported. The Pew Hispanic Center, a nonpartisan research organization in Washington, estimates 11.5 million to 12 million &amp;quot;unauthorized migrants&amp;quot; live in the US today.&amp;lt;ref&amp;gt;[http://www.csmonitor.com/2006/0516/p01s02-ussc.html Illegal immigrants in the US: How many are there?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although the diverse group of immigrants that have come to the U.S. speak many languages, [[English]] is the traditional unifying language of the United States and is necessary for full civic and cultural participation.&lt;br /&gt;
&lt;br /&gt;
The religious affiliation of the United States is summarized in the following table.&amp;lt;ref&amp;gt;2016 ''Britannica Book of the Year''.&amp;lt;/ref&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
!Religion&lt;br /&gt;
!Percentage&lt;br /&gt;
|-&lt;br /&gt;
|Independent Christian&lt;br /&gt;
|23.2%&lt;br /&gt;
|-&lt;br /&gt;
|[[Roman Catholic]]&lt;br /&gt;
|19.6%&lt;br /&gt;
|-&lt;br /&gt;
|[[Protestant]] (including Anglican)&lt;br /&gt;
|18.9%&lt;br /&gt;
|-&lt;br /&gt;
|unaffiliated [[Christian]]&lt;br /&gt;
|16.5%&lt;br /&gt;
|-&lt;br /&gt;
|[[Mormon]]/[[Jehovah's Witnesses]]&lt;br /&gt;
|3.3%&lt;br /&gt;
|-&lt;br /&gt;
|Jewish&lt;br /&gt;
|1.9%&lt;br /&gt;
|-&lt;br /&gt;
|Orthodox&lt;br /&gt;
|1.8%&lt;br /&gt;
|-&lt;br /&gt;
|Muslim&lt;br /&gt;
|1.6%&lt;br /&gt;
|-&lt;br /&gt;
|Buddhist&lt;br /&gt;
|0.9%&lt;br /&gt;
|-&lt;br /&gt;
|Other&lt;br /&gt;
|12.3%&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Geography==&lt;br /&gt;
&lt;br /&gt;
[[File:Colorado.jpg|thumb|[[Colorado]].]]&lt;br /&gt;
Forty-eight of the fifty United States form a regional grouping known as the contiguous United States, bordering both the North [[Atlantic Ocean]] and the North [[Pacific Ocean]] and lying between [[Canada]] and [[Mexico]]. Two of the fifty states, Alaska and Hawaii, are not contiguous with any of the other states. Alaska is located to the northwest of [[Canada]] and lies across the [[Bering Strait]] from the Russian Federation.  [[Hawaii]] is an [[archipelago]] located in the North Pacific Ocean.  Puerto Rico, which is largely self-governing, is a commonwealth and is considered part of the U.S., as are several smaller territories in the Pacific Ocean, such as Guam. Each of the 50 states has a large degree of sovereignty, but the boundaries are debated and shift slightly every year. &lt;br /&gt;
&lt;br /&gt;
At over 3.7 million square miles (over 9.6 million km²), the U.S. (including its non-contiguous and overseas states and territories) is the third largest country by total area (after Russia and Canada). It is the world's third most populous nation, with over 350 million people (after China and India). &lt;br /&gt;
&lt;br /&gt;
Mt. McKinley, Alaska, is the highest point in North America and Death Valley, California, is the lowest point on the continent.&amp;lt;ref&amp;gt;[https://www.cia.gov/library/publications/the-world-factbook/geos/us.html CIA World Factbook], ''North America :: United States'', Updated on February 23, 2011, (Accessed on February 23, 2011).&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Most American cities, such as [[Los Angeles]] or [[New York City]], are ugly, partly due to the massive inner-city crime within their boundaries and their failed leftist leadership which has ruined quality of life.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
===Natural Law===&lt;br /&gt;
Many people familiar with the American Revolution do not realize that America is based on [[Natural Law]].  As [[Cleon Skousen]] points out:&lt;br /&gt;
{{cquote|Most modern Americans have never studied Natural Law.  They are therefore mystified by the constant reference to Natural Law by the Founding Fathers.&amp;lt;ref&amp;gt;{{cite book|last1=Skousen|first1=Cleon|title=[[The Five Thousand Year Leap]]|date=1981|pages=33}}&amp;lt;/ref&amp;gt;}}&lt;br /&gt;
[[Natural Law]] recognizes that certain laws are natural; that is, these laws naturally existing ''pre-date'' the existence of governments.  Natural Law[s] generally indicate the existence of natural rights as well, which [[John Locke]] writes about in his book [[Two Treatises of Government]].  The writings of John Locke are mentioned several times in both the [[Constitutional Convention]] as well as [[The Federalist Papers]].  Natural Law is not only something that was very well understood by the generation that would become the [[Founding Fathers]], but it was also well recognized by the generations preceding the founding generation.  Those generations that landed on the shores of America, most of whom were seeking religious liberty.  The relationship between Liberty, Natural Law, and God can be seen in many of the documents preceding the founding, such as the dedication given at the [[Liberty Tree]] by a [[Sons of Liberty|son of liberty]] named [[Silas Downer]], as well as the first written constitution of the 13 colonies, [[Connecticut]]'s [[Fundamental Orders of Connecticut|Fundamental Orders]]&lt;br /&gt;
===American Revolution===&lt;br /&gt;
{{main|American Revolution}}&lt;br /&gt;
[[File:Washington-deleware.jpg|thumb|left|Washington, Chief of the Continental Army, is shown crossing the Delaware River.]]&lt;br /&gt;
The American Revolution exploded from fears the British Empire was trying to restrict the historic rights and liberties of Americans.  The British victory in the French and Indian War ended the threat that foreign powers might attack the colonies; Britain's protection was no longer needed. At the same time, Britain decided to assert its powers by imposing [[taxes]].  The taxes (as on stamps, sugar, and tea) were not large but the principle was simple: Americans insisted their own [[legislature]]s could impose taxes but not [[Parliament]], because Americans were not represented there. &amp;quot;No taxation without representation!&amp;quot; and &amp;quot;[[Don't tread on me]]&amp;quot; became common phrases in America by the American people, but the British refused over and over again to accept it.  London sent in troops when Boston protested vehemently, and Americans organized shadow governments in every colony. &lt;br /&gt;
&lt;br /&gt;
The Americans were adopting a new political philosophy, called [[republicanism]], which stressed civic virtue, fear of corruption, and disdain for [[aristocracy]] (there were no aristocrats in America apart from occasional British visitors). Republicanism alerted Americans to their constitutional rights as Englishmen – one right was that the people, through their elected officials, set the taxes and upheld law. Constitutionally, to Americans their &amp;quot;elected officials&amp;quot; were not represented in the British Parliament, it meant having their own colonial legislatures. The British replied haughtily toward this desire from the Americans, going so far as to suggest America was &amp;quot;virtually represented&amp;quot; by the British Parliament in some way or form. &lt;br /&gt;
&lt;br /&gt;
====Boston Tea Party====&lt;br /&gt;
{{main|Boston Tea Party}}&lt;br /&gt;
&lt;br /&gt;
The British Parliaments idea of representation in America fueled their desire to increase taxes on the Americans. The tax on stamps in 1765 incited near rebellion, as the 13 separate colonies began meeting together and sharing their grievances. The stamp tax was repealed but others followed, especially the tax on tea. In response, Americans boycotted tea and merchants refused to order it, except in Boston. There, a well-organized group of patriots dumped the tea in the harbor, historically known as the [[Boston Tea Party]]. These events infuriated London, so they sent troops to North America and stripped [[Massachusetts]] of its self-government and suspended the historic rights the colonists were so proud of. &lt;br /&gt;
&lt;br /&gt;
====Thirteen Colonies====&lt;br /&gt;
{{main|Thirteen Colonies}}  [[Image:Pop1750.jpg|right|thumb|400px]]&lt;br /&gt;
&lt;br /&gt;
The thirteen original colonies began organizing shadow governments, called &amp;quot;Committees of Correspondence,&amp;quot; which prepared the Americans for the day &amp;quot;patriots&amp;quot; (or &amp;quot;Whigs,&amp;quot; as they called themselves) could assume all functions of local government. That day came when the British sent troops from Boston to seize gunpowder in attempt to dismantle a potential revolt, and the American patriots gathered there to defend their liberty. These patriots were known as the American &amp;quot;Minute men,&amp;quot; a well trained militia, and had planned for this day at Lexington and Concord. When the militia clashed with the elite British troops they soundly defeated them, prompting an historic backlash from Britain. The American Revolution had begun. &lt;br /&gt;
&lt;br /&gt;
The thirteen colonies, organized as the &amp;quot;[[First Continental Congress]],&amp;quot; became a national government as the shadow governments in each colony took control and ousted all royal officials. Congress set up a [[Continental Army]] and gave command to an American hero and Virginia's leader, [[George Washington]]. George Washington took charge in Boston, and he forced the British to leave in the spring of 1776. All 13 colonies were at this point in control of the American Patriots, and they listened as [[Tom Paine]] explained ''Common Sense'' principles, proudly boasting of America's strength and its power as a new nation. America, in its own right as an individual nation no longer needed nor wanted a foreign [[King]]. Congress called on the colonies to become States and to write new State constitutions. On July 4, 1776, Congress unanimously declared the independence of a new nation, the United States of America.&lt;br /&gt;
&lt;br /&gt;
====France in the American Revolutionary War====&lt;br /&gt;
[[File:Marquis de Lafayette.jpg|thumb|[[Marquis de Lafayette]].]]&lt;br /&gt;
King [[George III]] could not abide the insolent Americans and he sent his small army and large navy to America in attempt to reconquer his lost colonies. They were able to recapture [[New York City]], but the King's failure to spread elsewhere greatly outweighed this small victory. The powerful Royal navy gave the British command of the seas and the ability to land troops anywhere and capture any specific place, but the shortage of British soldiers, and the very long 3000 mile supply line, meant that the British could only hold a few points at any one time. Hiring German soldiers (Hessians) was necessary, but they were not enough, for the Patriots always had more available soldiers. The British expectations that Loyalist would rise up and overthrow the Patriots was a [[chimera]]; the Loyalists did provide some help to British invasion forces, but were never strong enough to operate on their own or control any territory.&lt;br /&gt;
&lt;br /&gt;
[[France]], humiliated by Britain in the 1760s, was stronger in the late 1770s than it was a decade earlier and wanted revenge against the British for their past woes. Thus, the French secretly armed and financed the Americans. Lafayette, a French general in the American Revolutionary War, served in the Continental Army under George Washington. He convinced France to send their first naval and land forces to the Americas and participated in defending Richmond, Virginia from Benedict Arnold and in the battle of Yorktown, Virginia; Lafayette contributed in no slight degree toward the grand result.  &lt;br /&gt;
&lt;br /&gt;
In 1777, the British sent a large army to invade [[New York]] and cut off the revolutionary states of [[New England]]. The plan was a disaster as the American militia captured the entire British invasion force at Saratoga. Encouraged by diplomat [[Benjamin Franklin]], the French recognized the United States as an independent nation, signed a treaty of alliance, and entered the war against Britain. Later, the treaty extended to [[Spain]] and the [[Netherlands]] as allies to America; Britain's diplomacy was disjointed that it had no allies at all, and was militarily matched or surpassed by America and its new allies. The British invasion of the South in 1780-81 was designed to bring out Loyalist support, but it failed and the second major British army was captured at the [[Battle of Yorktown]]. The British Parliament revolted at their reckless king and his incompetent government and sued for peace, which was achieved on terms favorable to the U.S. in 1783. About 20% of the Loyalists moved to [[Canada]], but many stayed in America, and the new peaceful nation resumed its rapid growth.&lt;br /&gt;
&lt;br /&gt;
===New Nation===&lt;br /&gt;
[[File:Bierstadt Looking Down Yosemite-Valley 1865.jpg|thumb|[[Albert Bierstadt]], ''Looking Down Yosemite-Valley'', 1865.]]&lt;br /&gt;
In 1783, when the Treaty of Paris concluded the war of independence, the American population totalled some three million citizens and slaves living on about one million square miles of land.  Tens of thousands of [[Native Americans]] also lived in the [[Northwest Territory]] and the Southwest. &lt;br /&gt;
&lt;br /&gt;
The Thirteen original states are [[Connecticut]], [[Delaware]], [[Georgia]], [[Maryland]], [[Massachusetts]] (including [[maine]]), [[New Hampshire]], [[New Jersey]], [[New York]], [[North Carolina]], [[Pennsylvania]], [[Rhode Island]], [[South Carolina]] and [[Virginia]].  In 1790, an agreement between supporters of Jefferson and those of [[Alexander Hamilton]] resulted in the creation of the [[District of Columbia]] from part of [[Maryland]]; it has served as the national capital since 1800.  The remainder of the 1783 territory was eventually organized as the states of [[Ohio]], [[Indiana]], [[Michigan]], [[Illinois]], [[Wisconsin]], [[Kentucky]], [[Tennessee]], [[Mississippi]] and [[Alabama]].&lt;br /&gt;
&lt;br /&gt;
===Westward Expansion===&lt;br /&gt;
[[File:U.S. Territorial Acquisitions PD WC.jpg|thumb|left|Territorial acquisitions such as the Thirteen Colonies, the Louisiana Purchase, and British and Spanish Cession.]]&lt;br /&gt;
In 1803, [[French]] first consul [[Napoleon Bonaparte]] took advantage of a lull in his war with Great Britain to sell the [[Louisiana Territory]] to the United States, more than doubling the nation's land area.  This territory would later be organized as the states of [[Minnesota]], [[North Dakota]], [[South Dakota]], [[Montana]], [[Wyoming]], [[Nebraska]], [[Iowa]], [[Missouri]], [[Arkansas]], [[Kansas]], [[Oklahoma]], and [[Louisiana]] proper.  President Jefferson commissioned [[Lewis and Clark]] to explore the new territory from 1802 to 1804.&lt;br /&gt;
&lt;br /&gt;
The U.S. seized, then purchased [[Florida]] from Spain in 1819. [[Texas]] joined the United States in 1845 after winning its revolution against Mexico. &lt;br /&gt;
[[File:Map Leading Group by County US.jpg|thumb|Map Leading Group by County, 2000.]]&lt;br /&gt;
After victory the [[Mexican American War]] of 1846-48, the U.S. purchased via the [[Treaty of Guadalupe Hidalgo]] territory that became the states of [[California]], [[Nevada]], [[Utah]], [[Colorado]], [[New Mexico]] and [[Arizona]].  In 1846 the U.S. and Britain agreed that the 49th Parallel (degree of latitude) would serve as the boundary between the U. S. and [[British Columbia]] (now part of Canada). The American portion became the states of [[Washington]], [[Oregon]] and [[Idaho]].&lt;br /&gt;
&lt;br /&gt;
===Civil War===&lt;br /&gt;
{{main|American Civil War}}&lt;br /&gt;
An issue that had been left unresolved at the [[Constitutional Convention]] was [[slavery]].  The South's largely agricultural economy depended on slave labor to work its cotton plantations.  The North was more heavily industrialized, and slavery was outlawed in northern states.  After a series of failed compromises, the South broke away to form the [[Confederate States of America]], following the election of President [[Abraham Lincoln]] of the new [[Republican Party]] in the election of 1860.  Four long years of war ended in the spring of 1865 with the surrenders of Confederate generals [[Robert E. Lee]] at Appomattox, [[Virginia]] and [[Joseph E. Johnston]] at Durham, [[North Carolina]].&lt;br /&gt;
&lt;br /&gt;
===America Acquires an Empire===&lt;br /&gt;
&lt;br /&gt;
In 1867, the U.S. purchased [[Alaska]] from [[Russia]]. It became a state in 1959.&lt;br /&gt;
&lt;br /&gt;
Hawaii became an independent republic in 1894 and voluntarily joined the U.S. in 1898, becoming a state in 1960. &lt;br /&gt;
&lt;br /&gt;
As a result of the [[Spanish-American War]], the United States took control of the [[Philippines]] and annexed [[Puerto Rico]] and [[Guam]].  The Philippines became independent in 1946, after the U.S. reconquered the islands from Japan in World War II. [[Puerto Rico]] has occasionally held referendum that ratified its continuing unique &amp;quot;Commonwealth&amp;quot; status as part of the United States.  The residents of Puerto Rico are U.S. citizens.  Guam continues as a U.S. owned territory with full citizenship for its inhabitants. The people of Puerto Rico and Guam have a vote in presidential primaries and a voice, but not a vote, in Congress.&lt;br /&gt;
&lt;br /&gt;
==The Constitution and Politics in the United States==&lt;br /&gt;
&lt;br /&gt;
[[Image:76485685i79.jpg|right|thumb|300px|The drafting committee presenting the [[Declaration of Independence]] to the [[Continental Congress]], painted by John Trumbull 1817–1819.]]&lt;br /&gt;
&lt;br /&gt;
Between 1776 and 1788, the United States was governed according to the [[Articles of Confederation]].  The Founding Fathers formally established the current structure of the United States by ratification of the [[U.S. Constitution]] in 1788. Since 1789, that constitution has been the basic governing document. America's Founding Fathers understood that a democracy is always in flux and given to “mob rule,”&amp;lt;ref&amp;gt;[[Michelle Malkin]]. [http://michellemalkin.com/2009/03/27/the-coming-g20-riots-the-spread-of-mob-rule/comment-page-1/ The coming G20 riots &amp;amp; the spread of mob rule], ''Michelle Malkin'', March 27, 2009.&amp;lt;/ref&amp;gt; while a republic is fixed and stable, resting on “the Laws of Nature and of Nature’s God.” Because of the uncertainty of democracy, [[Benjamin Rush]] — a signer of the Declaration of Independence — wrote: “A simple democracy is one of the greatest of evils.”&amp;lt;ref&amp;gt;AWR Hawkins. [http://pajamasmedia.com/blog/america-a-republic-not-a-democracy/ America: A Republic, Not a Democracy], ''Pajamas Media'', September 03, 2009.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Sovereignty]] in America comes from the citizenry ([[self-governance]]), and the basic political values are called &amp;quot;[[republicanism]],&amp;quot; (not to be confused with the [[Republican Party]],)  especially the commitment to civic virtue and civic duty, and opposition to corruption and aristocracy.  Popular political parties emerged in the United States in the 1790s; currently the two major political parties are the [[Democratic Party]], and the [[Republican Party]]. Minor parties are of little importance overall but can be useful in pushing certain topics to the public eye. &lt;br /&gt;
&lt;br /&gt;
States within the United States must have their own individual Constitutions as well, which usually adhere to that individual State's understanding of Natural Law, however, the supreme rule of the United States Constitution take precedence.&amp;lt;ref&amp;gt;[http://newmexico.heavensentgaming.com/lexicon/american-modern-culture/ American modern culture] on the [[New Mexico Cultural Encyclopedia, Lexicon, and News]]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Contrary to popular belief, especially among [[liberal]]s, the United States is not a [[democracy]] and was never intended to be one.&amp;lt;ref name=&amp;quot;NotDemocracy&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== The Role of Religion in Government ===&lt;br /&gt;
{{main|Religion and U.S. Government}}&lt;br /&gt;
&lt;br /&gt;
==Government==&lt;br /&gt;
{{main|United States Federal Government}}&lt;br /&gt;
&lt;br /&gt;
[[Image:56eugyjnm.jpg|right|thumb|300px|The [[White House]], the official home and workplace of the [[President of the United States]] of America.]]&lt;br /&gt;
&lt;br /&gt;
===Executive Branch===&lt;br /&gt;
&lt;br /&gt;
*Chief of state: The [[President of the United States]] is both the chief of state and head of government&lt;br /&gt;
*Head of government: President of the United States; [[Vice President of the United States]]&lt;br /&gt;
*Cabinet: Cabinet appointed by the president with Senate approval&lt;br /&gt;
*Elections: The president and vice president serve four-year terms (eligible for a second term)&lt;br /&gt;
&lt;br /&gt;
===Legislative Branch===&lt;br /&gt;
&lt;br /&gt;
The United States legislative branch of government is a [[bicameral]] Congress, which consists of the [[United States Senate|Senate]] (100 seats, 2 members are elected from each state by popular vote to serve six-year terms; one-third are elected every two years) and the [[House of Representatives]] (435 seats; members are directly elected by popular vote to serve two-year terms).&lt;br /&gt;
&lt;br /&gt;
===Judicial Branch===&lt;br /&gt;
{{main|Supreme Court of the United States}}&lt;br /&gt;
&lt;br /&gt;
The United States [[Supreme Court]] consists of nine justices, nominated by the president and confirmed with the advice and consent of the Senate. The judicial branch also includes the United States Circuit Courts of Appeal, and the United States District Courts. Article III, Section 1, of the U.S. Constitution provides that judges serve &amp;quot;during good Behavior,&amp;quot; ''i.e.'', until they resign, die, or are impeached.  The Supreme Court's decision in ''Marbury v. Madison'' established judicial review, whereby the federal courts have the power to declare federal and state laws and actions of the executive branch of the federal or a state government unconstitutional.&lt;br /&gt;
&lt;br /&gt;
== Economy ==&lt;br /&gt;
&lt;br /&gt;
The US has the largest and most technologically powerful economy in the world, with a per capita GDP of $47,400. In this market-oriented economy, private individuals and business firms make most of the decisions, and the federal and state governments buy needed goods and services predominantly in the private marketplace. US business firms enjoy greater flexibility than their counterparts in [[Europe]] and [[Japan]] in decisions to expand capital plant, to lay off surplus workers, and to develop new products. At the same time, they face higher barriers to enter their rivals' home markets than foreign firms face entering US markets. US firms are at or near the forefront in technological advances, especially in computers and in medical, aerospace, and military equipment; their advantage has narrowed since the end of World War II. &lt;br /&gt;
&lt;br /&gt;
The onrush of technology largely explains the gradual development of a &amp;quot;two-tier labor market&amp;quot; in which those at the bottom lack the education and the professional/technical skills of those at the top and, more and more, fail to get comparable pay raises, health insurance coverage, and other benefits. Unfortunately, China remains both the banker and salesman to the United State's role as buyer, and debtor. This will not end well for the United States, Republican president or not. Since 1975, practically all the gains in household income have gone to the top 20% of households. The war in March–April 2003 between a US-led coalition and Iraq, and the subsequent occupation of Iraq, required major shifts in national resources to the military. Soaring oil prices between 2005 and the first half of 2008 threatened [[inflation]] and [[unemployment]], as higher gasoline prices ate into consumers' budgets. Imported oil accounts for about 60% of US consumption. Long-term problems include inadequate investment in economic infrastructure, rapidly rising medical and pension costs of an aging population, sizable [[trade deficit]]s and [[budget deficit]]s, and stagnation of family income in the lower economic groups. &lt;br /&gt;
[[File:Gast1872.jpg|thumb|&amp;quot;American Progress,&amp;quot; painting by John Gast, 1872.]]&lt;br /&gt;
The merchandise trade deficit reached a record $840 billion in 2008 before shrinking to $506 billion in 2009, and ramping back up to $630 billion in 2010. The global economic downturn, the sub-prime mortgage crisis, investment bank failures, falling home prices, and tight credit pushed the United States into a [[recession]] by mid-2008. [[GDP]] contracted until the third quarter of 2009, making this the deepest and longest downturn since the [[Great Depression]]. To help stabilize financial markets, the US Congress established a $700 billion Troubled Asset Relief Program (TARP) in October 2008. The government used some of these funds to purchase equity in US banks and other industrial corporations, much of which had been returned to the government by early 2011. &lt;br /&gt;
&lt;br /&gt;
In January 2009 the US Congress passed and President [[Barack Obama]] signed a bill providing an additional $787 billion fiscal stimulus to be used over 10 years - two-thirds on additional spending and one-third on tax cuts - to create jobs and to help the economy recover. Approximately two-thirds of these funds were injected into the economy by the end of 2010. In March 2010, President Obama signed a health insurance reform bill into law that will extend coverage to an additional 32 million American citizens by 2016, through private health insurance for the general population and Medicaid for the impoverished. In July 2010, the president signed the DODD-FRANK Wall Street Reform and Consumer Protection Act, a bill designed to promote financial stability by protecting consumers from financial abuses, ending taxpayer bailouts of financial firms, dealing with troubled banks that are &amp;quot;too big to fail,&amp;quot; and improving accountability and transparency in the financial system - in particular, by requiring certain financial derivatives to be traded in markets that are subject to government regulation and oversight. &lt;br /&gt;
&lt;br /&gt;
In November 2010, in an attempt to keep interest rates from rising and snuffing out the nascent recovery, the US Federal Reserve Bank (The Fed) announced that it would purchase $600 billion worth of US Government bonds by June 2011.&lt;br /&gt;
&lt;br /&gt;
The United States is the leading industrial power in the world, highly diversified and technologically advanced; [[petroleum]], [[steel]], motor vehicles, aerospace, telecommunications, chemicals, [[electronics]], food processing, consumer goods, lumber, mining.&lt;br /&gt;
&amp;lt;ref&amp;gt;[https://www.cia.gov/library/publications/the-world-factbook/geos/us.html CIA - The world Factbook]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Flag Description==&lt;br /&gt;
[[Image:50 star flag.png|left|thumb|150px|The [[Flag of the United States of America]]]]&lt;br /&gt;
{{main|Flag of the United States of America}}&lt;br /&gt;
&lt;br /&gt;
Thirteen equal horizontal stripes of red (top and bottom) alternating with white; there is a blue rectangle in the upper hoist-side corner bearing 50 small, white, five-pointed stars arranged in nine offset horizontal rows of six stars (top and bottom) alternating with rows of five stars; the 50 stars represent the 50 states, the 13 stripes represent the 13 original colonies; known as Old Glory; the design and colors might have been the basis for a number of other flags, including [[Chile]], [[Liberia]], [[Malaysia]], and [[Puerto Rico]].&lt;br /&gt;
&lt;br /&gt;
{{Clear}}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
[[File:Weir, Afternoon by the Pond, ca. 1908-1909.jpg|thumb|Julian Alden Weir, Afternoon by the Pond, ca. 1908-1909.]]&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Clear}}&lt;br /&gt;
&lt;br /&gt;
== See also==&lt;br /&gt;
[[File:Lawrence The Migration of the Negro.jpg|thumb|The Migration of the Negro by [[Jacob Lawrence]], 1940-1941.]]&lt;br /&gt;
*[[Pledge of Allegiance]]&lt;br /&gt;
*[[Famous American artists]]&lt;br /&gt;
*[[List of 50 states]]&lt;br /&gt;
*[[Americas]]&lt;br /&gt;
*[[America (continent)]]&lt;br /&gt;
*[[Columbia]]&lt;br /&gt;
*[[Gallery of American Masterpieces]]&lt;br /&gt;
*[[Christian Nation]]&lt;br /&gt;
*[[American conservatism]]&lt;br /&gt;
*[[Sociology of &amp;quot;atheism is un-American&amp;quot; view]]&lt;br /&gt;
*[[Adair v. United States]]&lt;br /&gt;
*[[Americana]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Clear}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*[[CIA]] - [https://www.cia.gov/library/publications/the-world-factbook/geos/us.html The World FactBook]&lt;br /&gt;
*[https://www.britannica.com/EBchecked/topic/616563/United-States United States.]&lt;br /&gt;
*[http://www.nationsonline.org/oneworld/america.htm America]&lt;br /&gt;
*[http://www.nationsonline.org/oneworld/flags_of_us_states.htm Flags of the U.S. States]&lt;br /&gt;
*[http://www.pibmug.com/files/map_test.swf Interactive map test of the 50 U.S. states]&lt;br /&gt;
*[http://www.u-s-history.com/pages/h445.html U.S. History]&lt;br /&gt;
*[http://www.theroot.com/buzz/who-owns-united-states Who Owns the United States?]&lt;br /&gt;
*[http://sociology.ucsc.edu/whorulesamerica/power/wealth.html Wealth, Income, and Power.] by G. William Domhoff, University of California Santa Cruz.&lt;br /&gt;
*[http://bertschlossberg.blogspot.com/ Real Life and Death: the Bible, Israel, and America interplay]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{USstates}}&lt;br /&gt;
&lt;br /&gt;
[[Category:North American Countries]]&lt;br /&gt;
[[Category:United States of America]]&lt;br /&gt;
[[Category:NATO Members]]&lt;br /&gt;
[[Category:United States History]]&lt;br /&gt;
[[Category:Featured articles]]&lt;br /&gt;
[[Category:Christian-Majority Countries]]&lt;/div&gt;</summary>
		<author><name>Ihatehumans</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Haskell&amp;diff=1476642</id>
		<title>Haskell</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Haskell&amp;diff=1476642"/>
		<updated>2018-12-23T22:47:06Z</updated>

		<summary type="html">&lt;p&gt;Ihatehumans: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Haskell''' {{IPAc-en|ˈ|h|æ|s|k|əl}}&amp;lt;ref&amp;gt;{{cite mailing list |url=http://www.haskell.org/pipermail/haskell-cafe/2008-January/038756.html |title=anybody can tell me the pronunciation of &amp;quot;haskell&amp;quot;? |date=28 January 2008 |accessdate=12 March 2011 |mailinglist=Haskell-cafe |last=Chevalier |first=Tim}}&amp;lt;/ref&amp;gt; is a standardized, [[General-purpose programming language|general-purpose]], [[purely functional programming]] language with [[non-strict semantics]] and [[Strong typing|strong]] [[static typing]].{{sfn|Peyton Jones|2003}} It is named after [[logician]] [[Haskell Curry]].{{sfn|Hudak|Hughes|Peyton Jones|Wadler|2007}} The latest standard of Haskell is Haskell 2010. {{As of|2016|05}}, a group is working on the next version, Haskell 2020.&amp;lt;ref&amp;gt;https://mail.haskell.org/pipermail/haskell-prime/2016-April/004050.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Haskell features a [[type system]] with [[type inference]]&amp;lt;ref&amp;gt;Type inference originally using [[Type inference#Hindley.E2.80.93Milner type inference algorithm|Hindley-Milner type inference]]&amp;lt;/ref&amp;gt; and [[lazy evaluation]].&amp;lt;ref&amp;gt;This allows finer control over the expression [[evaluation strategy]]&amp;lt;/ref&amp;gt; [[Type classes]]  first appeared in the Haskell programming language.&amp;lt;ref&amp;gt;&amp;quot;Type classes, first proposed during the design of the Haskell programming language, ...&amp;quot;&amp;amp;nbsp;—[https://jgbm.github.io/pubs/morris-dissertation.pdf John Garrett Morris (2013), &amp;quot;Type Classes and Instance Chains: A Relational Approach&amp;quot; ]&amp;lt;/ref&amp;gt; Its main implementation is the [[Glasgow Haskell Compiler]].&lt;br /&gt;
&lt;br /&gt;
Haskell is based on the [[Semantics of programming languages|semantics]], but not the syntax, of the language [[Miranda (programming language)|Miranda]], which served to focus the efforts of the initial Haskell working group.&amp;lt;ref&amp;gt;Edward Kmett, [https://www.youtube.com/watch?v=hIZxTQP1ifo  Edward Kmett - Type Classes vs. the World]&amp;lt;/ref&amp;gt; Haskell is used widely in academia&amp;lt;ref&amp;gt;{{cite web|url=https://wiki.haskell.org/Haskell_in_education|title=Haskell in education|publisher=|accessdate=15 February 2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|url=https://wiki.haskell.org/Haskell_in_research|title=Haskell in research|publisher=|accessdate=15 February 2016}}&amp;lt;/ref&amp;gt; and industry.&amp;lt;ref&amp;gt;{{cite web|url=https://wiki.haskell.org/Haskell_in_industry|title=Haskell in industry|publisher=|accessdate=15 February 2016}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
Following the release of [[Miranda (programming language)|Miranda]] by Research Software Ltd. in 1985, interest in [[Lazy evaluation|lazy functional languages]] grew. By 1987, more than a dozen [[non-strict]], purely functional programming languages existed. Miranda was the most widely used, but it was [[proprietary software]]. At the conference on [[Functional Programming Languages and Computer Architecture]] (FPCA '87) in [[Portland, Oregon]], there was a strong consensus that a committee be formed to define an [[open standard]] for such languages. The committee's purpose was to consolidate existing [[functional languages]] into a common one to serve as a basis for future research in functional-language design.{{sfn|Peyton Jones|2003|loc=Preface}}&lt;br /&gt;
&lt;br /&gt;
===Haskell 1.0 to 1.4===&lt;br /&gt;
&amp;lt;!-- To do: Describe the change-over in I/O, from lazy streams to monads. --&amp;gt;&lt;br /&gt;
The first version of Haskell (&amp;quot;Haskell 1.0&amp;quot;) was defined in 1990.{{sfn|Hudak|Hughes|Peyton Jones|Wadler|2007}} The committee's efforts resulted in a series of language definitions (1.0, 1.1, 1.2, 1.3, 1.4).&lt;br /&gt;
&lt;br /&gt;
===Haskell 98===&lt;br /&gt;
In late 1997, the series culminated in ''Haskell 98'', intended to specify a stable, minimal, portable version of the language and an accompanying standard [[library (computer science)|library]] for teaching, and as a base for future extensions. The committee expressly welcomed creating extensions and variants of Haskell 98 via adding and incorporating experimental features.{{sfn|Peyton Jones|2003|loc=Preface}}&lt;br /&gt;
&lt;br /&gt;
In February 1999, the Haskell 98 language standard was originally published as ''The Haskell 98 Report''.{{sfn|Peyton Jones|2003|loc=Preface}} In January 2003, a revised version was published as ''Haskell 98 Language and Libraries: The Revised Report''.{{sfn|Peyton Jones|2003}} The language continues to evolve rapidly, with the [[Glasgow Haskell Compiler]] (GHC) implementation representing the current ''de facto'' standard.&amp;lt;ref name=HaskellWikiImpl&amp;gt;{{cite web|title=Haskell Wiki: Implementations|url=http://www.haskell.org/haskellwiki/Implementations|accessdate=18 December 2012}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Haskell 2010===&lt;br /&gt;
In early 2006, the process of defining a successor to the Haskell 98 standard, informally named ''Haskell Prime'', began.&amp;lt;ref&amp;gt;{{cite web|url=https://prime.haskell.org/|title=Welcome to Haskell'|work=The Haskell' Wiki}}&amp;lt;/ref&amp;gt; This was intended to be an ongoing incremental process to revise the language definition, producing a new revision up to once per year.  The first revision, named '''Haskell 2010''', was announced in November 2009&amp;lt;ref name=&amp;quot;2010ann&amp;quot;/&amp;gt; and published in July 2010.&lt;br /&gt;
&lt;br /&gt;
Haskell 2010 is an incremental update to the language, mostly incorporating several well-used and uncontroversial features previously enabled via compiler-specific flags.&lt;br /&gt;
* Hierarchical module names. Module names are allowed to consist of dot-separated sequences of capitalised identifiers, rather than only one such identifier. This lets modules be named in a hierarchical manner (e.g., &amp;lt;code&amp;gt;Data.List&amp;lt;/code&amp;gt; instead of &amp;lt;code&amp;gt;List&amp;lt;/code&amp;gt;), although technically modules are still in a single monolithic namespace. This extension was specified in an addendum to Haskell 98 and was in practice universally used.&lt;br /&gt;
* The [[foreign function interface]] (FFI) allows bindings to other programming languages. Only bindings to [[C (programming language)|C]] are specified in the Report, but the design allows for other language bindings. To support this, data type declarations were permitted to contain no constructors, enabling robust nonce types for foreign data that could not be constructed in Haskell. This extension was also previously specified in an Addendum to the Haskell 98 Report and widely used.&lt;br /&gt;
* So-called ''n''+''k'' patterns (definitions of the form &amp;lt;code&amp;gt;fact (n+1) = (n+1) * fact n&amp;lt;/code&amp;gt;) were no longer allowed. This [[syntactic sugar]] had misleading semantics, in which the code looked like it used the &amp;lt;code&amp;gt;(+)&amp;lt;/code&amp;gt; operator, but in fact desugared to code using &amp;lt;code&amp;gt;(-)&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;(&amp;gt;=)&amp;lt;/code&amp;gt;.&lt;br /&gt;
* The rules of [[type inference]] were relaxed to allow more programs to type check.&lt;br /&gt;
* Some [[Syntax (programming languages)|syntax]] issues (changes in the formal grammar) were fixed: pattern guards were added, allowing pattern matching within guards; resolution of [[Order of operations|operator fixity]] was specified in a simpler way that reflected actual practice; an edge case in the interaction of the language's [[lexical syntax]] of operators and comments was addressed; and the interaction of do-notation and if-then-else was tweaked to eliminate unexpected syntax errors.&lt;br /&gt;
* The &amp;lt;code&amp;gt;LANGUAGE&amp;lt;/code&amp;gt; [[Directive (programming)|pragma]] was specified. By 2010 dozens of extensions to the language were in wide use, and GHC (among other compilers) provided the &amp;lt;code&amp;gt;LANGUAGE&amp;lt;/code&amp;gt; pragma to specify individual extensions with a list of identifiers. Haskell 2010 compilers are required to support the &amp;lt;code&amp;gt;Haskell2010&amp;lt;/code&amp;gt; extension, and are encouraged to support several others which correspond to extensions added in Haskell 2010.&lt;br /&gt;
&lt;br /&gt;
==Features==&lt;br /&gt;
{{Main|Haskell features}}&lt;br /&gt;
{{See also|Glasgow Haskell Compiler#Extensions to Haskell}}&lt;br /&gt;
&lt;br /&gt;
Haskell features [[lazy evaluation]], lambda expressions, [[pattern matching]], [[list comprehension]], [[type class]]es and [[type polymorphism]]. It is a [[purely functional language]], which means that functions generally have no [[Side effect (computer science)|side effects]]. A distinct construct exists to represent side effects, [[Orthogonal#Computer science|orthogonal]] to the type of functions. A pure function can return a side effect that is subsequently executed, modeling the [[Pure function#Impure functions|impure functions]] of other languages.&lt;br /&gt;
&lt;br /&gt;
Haskell has a [[strongly typed programming language|strong]], [[static type#Static typing|static]] type system based on [[Hindley–Milner type inference]]. Its principal innovation in this area is type classes, originally conceived as a principled way to add [[Polymorphism (computer science)|overloading]] to the language,&amp;lt;ref name=&amp;quot;wadler89&amp;quot;&amp;gt;{{cite journal|last1=Wadler|first1=P.|first2=S. |last2=Blott|year=1989|title=How to make ad-hoc polymorphism less ad hoc|journal=Proceedings of the 16th ACM [[SIGPLAN]]-[[SIGACT]] [[Symposium on Principles of Programming Languages]]|publisher=[[Association for Computing Machinery|ACM]]|pages=60–76|doi=10.1145/75277.75283|isbn=0-89791-294-2}}&amp;lt;/ref&amp;gt; but since finding many more uses.&amp;lt;ref name=&amp;quot;hallgren01&amp;quot;&amp;gt;{{cite journal|last=Hallgren|first=T.|date=January 2001|title=Fun with Functional Dependencies, or Types as Values in Static Computations in Haskell|journal=Proceedings of the Joint CS/CE Winter Meeting|location=Varberg, Sweden|url=http://www.cs.chalmers.se/~hallgren/Papers/wm01.html}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The construct that represents side effects is an example of a [[Monad (functional programming)|monad]]. Monads are a general framework that can model different kinds of computation, including error handling, [[Nondeterministic algorithm|nondeterminism]], [[parsing]] and [[software transactional memory]]. Monads are defined as ordinary datatypes, but Haskell provides some [[syntactic sugar]] for their use.&lt;br /&gt;
&lt;br /&gt;
Haskell has an open, published specification,{{sfn|Peyton Jones|2003}} and [[#Implementations|multiple implementations exist]]. Its main implementation, the [[Glasgow Haskell Compiler]] (GHC), is both an [[Interpreter (computing)|interpreter]] and [[Machine code|native-code]] [[compiler]] that runs on most platforms. GHC is noted for its rich type system incorporating recent innovations such as [[generalized algebraic data type]]s and type families. [[The Computer Language Benchmarks Game]] also highlights its high-performance implementation of [[Concurrency (computer science)|concurrency]] and [[Parallel computing|parallelism]].&amp;lt;ref name=&amp;quot;shootout&amp;quot;&amp;gt;[http://benchmarksgame.alioth.debian.org/u64q/haskell.html Computer Language Benchmarks Game]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
An active, growing community exists around the language, and more than 5,400 third-party open-source libraries and tools are available in the online package repository ''Hackage''.&amp;lt;ref name=&amp;quot;hackage-stats&amp;quot;&amp;gt;{{cite web|url=http://hackage.haskell.org/cgi-bin/hackage-scripts/stats|archiveurl=https://web.archive.org/web/20130503114836/http://hackage.haskell.org/cgi-bin/hackage-scripts/stats|archivedate=2013-05-03 |title=HackageDB statistics |publisher=Hackage.haskell.org |accessdate=2013-06-26}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Code examples==&lt;br /&gt;
{{See also|Haskell features#Examples}}&lt;br /&gt;
A [[Hello world program|&amp;quot;Hello world&amp;quot; program]] in Haskell (only the last line is strictly necessary):&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
module Main (main) where          -- not needed in interpreter, is the default in a module file&lt;br /&gt;
&lt;br /&gt;
main :: IO ()                       -- the compiler can infer this type definition&lt;br /&gt;
main = putStrLn &amp;quot;Hello, World!&amp;quot;&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The [[factorial]] function in Haskell, defined in a few different ways:&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
-- Type annotation (optional, same for each implementation)&lt;br /&gt;
factorial :: (Integral a) =&amp;gt; a -&amp;gt; a&lt;br /&gt;
&lt;br /&gt;
-- Using recursion (with the &amp;quot;ifthenelse&amp;quot; expression)&lt;br /&gt;
factorial n = if n &amp;lt; 2&lt;br /&gt;
              then 1&lt;br /&gt;
              else n * factorial (n - 1)&lt;br /&gt;
&lt;br /&gt;
-- Using recursion (with pattern matching)&lt;br /&gt;
factorial 0 = 1&lt;br /&gt;
factorial n = n * factorial (n - 1)&lt;br /&gt;
&lt;br /&gt;
-- Using recursion (with guards)&lt;br /&gt;
factorial n&lt;br /&gt;
   | n &amp;lt; 2     = 1&lt;br /&gt;
   | otherwise = n * factorial (n - 1)&lt;br /&gt;
&lt;br /&gt;
-- Using a list and the &amp;quot;product&amp;quot; function&lt;br /&gt;
factorial n = product [1..n]&lt;br /&gt;
&lt;br /&gt;
-- Using fold (implements &amp;quot;product&amp;quot;)&lt;br /&gt;
factorial n = foldl (*) 1 [1..n]&lt;br /&gt;
&lt;br /&gt;
-- Point-free style&lt;br /&gt;
factorial = foldr (*) 1 . enumFromTo 1&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
Because the ''Integer'' type has [[arbitrary-precision]], this code will compute values such as &amp;lt;code&amp;gt;factorial 100000&amp;lt;/code&amp;gt; (a 456,574-digit number), with no loss of precision.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An implementation of an algorithm similar to [[quick sort]] over lists, where the first element is taken as the pivot:&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
-- Type annotation (optional, same for each implementation)&lt;br /&gt;
quickSort :: Ord a =&amp;gt; [a] -&amp;gt; [a]&lt;br /&gt;
&lt;br /&gt;
-- Using list comprehensions&lt;br /&gt;
quickSort []     = []                               -- The empty list is already sorted&lt;br /&gt;
quickSort (x:xs) = quickSort [a | a &amp;lt;- xs, a &amp;lt; x]   -- Sort the left part of the list&lt;br /&gt;
                   ++ [x] ++                        -- Insert pivot between two sorted parts&lt;br /&gt;
                   quickSort [a | a &amp;lt;- xs, a &amp;gt;= x]  -- Sort the right part of the list&lt;br /&gt;
&lt;br /&gt;
-- Using filter&lt;br /&gt;
quickSort []     = []&lt;br /&gt;
quickSort (x:xs) = quickSort (filter (&amp;lt;x) xs)&lt;br /&gt;
                   ++ [x] ++&lt;br /&gt;
                   quickSort (filter (&amp;gt;=x) xs)&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Implementations==&lt;br /&gt;
&amp;lt;!-- To anyone wishing to expand or improve this section: the article &amp;quot;A History of Haskell: Being Lazy With Class&amp;quot;, linked to in the Further reading section contains detailed descriptions of all implementations. --&amp;gt;&lt;br /&gt;
All listed implementations are distributed under [[open source license]]s.&amp;lt;ref name=&amp;quot;implementations&amp;quot;&amp;gt;[http://www.haskell.org/haskellwiki/Implementations &amp;quot;Implementations&amp;quot;] at the Haskell Wiki&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Implementations that fully or nearly comply with the Haskell 98 standard, include:&lt;br /&gt;
* The ''[[Glasgow Haskell Compiler]]'' (GHC) compiles to native code on many different processor architectures, and to [[ANSI C]], via one of two [[intermediate language]]s: [[C--]], or in more recent versions, [[LLVM]] (formerly Low Level Virtual Machine) bitcode.&amp;lt;ref&amp;gt;{{cite web|&lt;br /&gt;
url=https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/Backends/LLVM|&lt;br /&gt;
title=The LLVM Backend|&lt;br /&gt;
website=GHC Trac}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite conference &lt;br /&gt;
| url = http://www.cse.unsw.edu.au/~chak/papers/TC10.html&lt;br /&gt;
| title = An LLVM Backend for GHC&lt;br /&gt;
| last1 = Terei&lt;br /&gt;
| first1 = David A.&lt;br /&gt;
| last2 = Chakravarty&lt;br /&gt;
| first2 = Manuel M. T.&lt;br /&gt;
| date = 2010&lt;br /&gt;
| publisher = ACM Press&lt;br /&gt;
| book-title = Proceedings of ACM SIGPLAN Haskell Symposium 2010}}&amp;lt;/ref&amp;gt; GHC has become the ''de facto'' standard Haskell dialect.&amp;lt;ref&amp;gt;C. Ryder and S. Thompson (2005). [http://kar.kent.ac.uk/14237/1/Tech_Chris.pdf &amp;quot;Porting HaRe to the GHC API&amp;quot;]&amp;lt;/ref&amp;gt; There are libraries (e.g., bindings to [[OpenGL]]) that work only with GHC. GHC is also distributed with the [[Haskell platform]].&lt;br /&gt;
* The ''Utrecht Haskell Compiler'' (UHC) is a Haskell implementation from [[Utrecht University]].&amp;lt;ref&amp;gt;[http://www.cs.uu.nl/wiki/UHC Utrecht Haskell Compiler]&amp;lt;/ref&amp;gt; It supports almost all Haskell 98 features plus many experimental extensions. It is implemented using [[attribute grammar]]s and is currently used mostly for research on generated type systems and language extensions.&lt;br /&gt;
* ''Jhc'', a Haskell compiler written by John Meacham, emphasizes speed and efficiency of generated programs and exploring new program transformations. &lt;br /&gt;
** ''Ajhc'' is a fork of Jhc.&lt;br /&gt;
* ''LHC'' is a whole-program optimizing backend for GHC, based on Urban Boquist’s compiler intermediate language, GRIN.&amp;lt;ref&amp;gt;{{cite journal |last=Boquist |first=Urban |author2=Johnsson, Thomas |title=The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages |journal=LNCS |year=1996 |volume=1268 |pages=58–84}}&amp;lt;/ref&amp;gt; Older versions of LHC were based on Jhc rather than GHC.&lt;br /&gt;
&lt;br /&gt;
Implementations no longer actively maintained include:&lt;br /&gt;
* The ''Haskell User's Gofer System'' ([[Hugs]]) is a [[bytecode]] interpreter. It was once one of the implementations used most widely, alongside the GHC compiler,{{sfn|Hudak|Hughes|Peyton Jones|Wadler|2007|p=12-22}} but has now been mostly replaced by GHCi. It also comes with a graphics library.&lt;br /&gt;
* ''nhc98'' is a bytecode compiler focusing on minimizing memory use.&lt;br /&gt;
** The ''York Haskell Compiler'' ([[Yhc]]) was a fork of nhc98, with the goals of being simpler, more portable and efficient, and integrating support for Hat, the Haskell tracer. It also had a [[JavaScript]] backend, allowing users to run Haskell programs in [[web browser]]s.&lt;br /&gt;
* ''HBC'' is an early implementation supporting Haskell 1.4. It was implemented by [[Lennart Augustsson]] in, and based on, [[Lazy ML]]. It has not been actively developed for some time.&lt;br /&gt;
&lt;br /&gt;
Implementations not fully Haskell 98 compliant, and using a variant Haskell language, include:&lt;br /&gt;
* ''[[Gofer (software)|Gofer]]'' was an educational dialect of Haskell, with a feature called ''constructor classes'', developed by Mark Jones. It was supplanted by Hugs (see above).&lt;br /&gt;
* ''[[Helium (Haskell)|Helium]]'' is a newer dialect of Haskell. The focus is on making learning easier via clearer error messages. It currently lacks full support for type classes, rendering it incompatible with many Haskell programs.&lt;br /&gt;
*Eta and [[Frege (programming language)|Frege]] are dialects of Haskell targeting the [[Java virtual machine|Java Virtual Machine]].&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
* [[Darcs]] is a [[revision control system]] written in Haskell, with several innovative features, such as more precise control of patches to apply.&lt;br /&gt;
* [[Cabal (software)|Cabal]] is a tool for [[Build automation|building]] and packaging Haskell libraries and programs.&amp;lt;ref&amp;gt;{{cite web|url=https://www.haskell.org/cabal/|title=The Haskell Cabal|accessdate=8 April 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Linspire]] GNU/Linux chose Haskell for system tools development.&amp;lt;ref&amp;gt;{{cite web|url=http://urchin.earth.li/pipermail/debian-haskell/2006-May/000169.html|title=Linspire/Freespire Core OS Team and Haskell|work=Debian Haskell mailing list|date=May 2006}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Xmonad]] is a [[window manager]] for the [[X Window System]], written fully in Haskell.&amp;lt;ref&amp;gt;xmonad.org&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Glasgow Haskell Compiler|GHC]] is also often a testbed for advanced functional programming features and optimizations in other programming languages.&lt;br /&gt;
* [[Pandoc]] is a tool to convert one markup format into another.&lt;br /&gt;
* The Shake build system, aiming to be reliable, robust, and fast.&amp;lt;ref&amp;gt;[http://shakebuild.com/ Shake Build System]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* ShellCheck - A shell script static analysis tool.&amp;lt;ref&amp;gt;[https://github.com/koalaman/shellcheck/ ShellCheck]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Industry===&lt;br /&gt;
* [[Facebook]] implements its anti-spam programs&amp;lt;ref&amp;gt;{{cite web |title = Facebook’s New Spam-Killer Hints at the Future of Coding |url = https://www.wired.com/2015/09/facebooks-new-anti-spam-system-hints-future-coding/ |accessdate = September 1, 2015 |date = September 1, 2015 |website = [[Wired (magazine)|Wired]] |publisher = |last = Metz |first = Cade}}&amp;lt;/ref&amp;gt; in Haskell, as [[open-source software]].&amp;lt;ref&amp;gt;[https://code.facebook.com/posts/302060973291128/open-sourcing-haxl-a-library-for-haskell/ Simon Marlow (2014),  Open-sourcing Haxl]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Swift Navigation]], a high precision GPS manufacturer, implements significant portions of its product in Haskell, providing some [[open source software]].&amp;lt;ref&amp;gt;[https://github.com/swift-nav/wolf/ Swift-Nav (2018)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Bluespec, Inc.|Bluespec]] SystemVerilog (BSV) is a language for semiconductor design that is an extension of Haskell. Also, Bluespec, Inc.'s tools are implemented in Haskell.&lt;br /&gt;
* [[Cryptol]], a language and toolchain for developing and verifying [[cryptography]] algorithms, is implemented in Haskell.&lt;br /&gt;
* [[seL4]], the first [[Formal methods|formally verified]] [[microkernel]],&amp;lt;ref name=&amp;quot;klein-sosp09&amp;quot;&amp;gt;&lt;br /&gt;
A formal proof of functional correctness was completed in 2009.&lt;br /&gt;
{{ cite conference&lt;br /&gt;
 | first1 = Gerwin&lt;br /&gt;
 | last1 = Klein&lt;br /&gt;
 | first2 = Kevin&lt;br /&gt;
 | last2 = Elphinstone&lt;br /&gt;
 | first3 = Gernot&lt;br /&gt;
 | last3 = Heiser&lt;br /&gt;
 | author3-link = Gernot Heiser&lt;br /&gt;
 | first4 = June&lt;br /&gt;
 | last4 = Andronick&lt;br /&gt;
 | first5 = David&lt;br /&gt;
 | last5 = Cock&lt;br /&gt;
 | first6 = Philip&lt;br /&gt;
 | last6 = Derrin&lt;br /&gt;
 | first7 = Dhammika&lt;br /&gt;
 | last7 = Elkaduwe&lt;br /&gt;
 | first8 = Kai&lt;br /&gt;
 | last8 = Engelhardt&lt;br /&gt;
 | first9 = Rafal&lt;br /&gt;
 | last9 = Kolanski&lt;br /&gt;
 | first10 = Michael&lt;br /&gt;
 | last10 = Norrish&lt;br /&gt;
 | first11 = Thomas&lt;br /&gt;
 | last11 = Sewell&lt;br /&gt;
 | first12 = Harvey&lt;br /&gt;
 | last12 = Tuch&lt;br /&gt;
 | first13 = Simon&lt;br /&gt;
 | last13 = Winwood&lt;br /&gt;
 | title = seL4: Formal verification of an OS kernel&lt;br /&gt;
 | booktitle = 22nd ACM Symposium on Operating System Principles&lt;br /&gt;
 |date=October 2009&lt;br /&gt;
 | location = Big Sky, MT, USA&lt;br /&gt;
 | doi =&lt;br /&gt;
 | url = http://www.sigops.org/sosp/sosp09/papers/klein-sosp09.pdf&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;/ref&amp;gt; used Haskell as a prototyping language for the OS developer.&amp;lt;ref name=&amp;quot;klein-sosp09&amp;quot;/&amp;gt;{{rp|p.2}} At the same time, the Haskell code defined an executable specification with which to reason, for automatic translation by the theorem-proving tool.&amp;lt;ref name=&amp;quot;klein-sosp09&amp;quot;/&amp;gt;{{rp|p.3}} The Haskell code thus served as an intermediate prototype before final [[C (programming language)|C]] refinement.&amp;lt;ref name=&amp;quot;klein-sosp09&amp;quot;/&amp;gt;{{rp|p.3}}&lt;br /&gt;
&lt;br /&gt;
===Web===&lt;br /&gt;
Haskell [[web framework]]s exist,&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/haskellwiki/Web/Frameworks|title=Web/Frameworks|publisher=}}&amp;lt;/ref&amp;gt; including:&lt;br /&gt;
* [[Yesod (web framework)|Yesod]]&lt;br /&gt;
* [[Snap (web framework)|Snap]]&amp;lt;ref&amp;gt;{{cite web|url=http://snapframework.com/ |title=Snap: A Haskell Web Framework: Home |publisher=Snapframework.com |accessdate=2013-06-26}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Miso (web framework)|Miso]]&lt;br /&gt;
&lt;br /&gt;
==Criticism==&lt;br /&gt;
&lt;br /&gt;
Jan-Willem Maessen, in 2002, and [[Simon Peyton Jones]], in 2003, discussed problems associated with lazy evaluation while also acknowledging the theoretical motives for it.&amp;lt;ref&amp;gt;Jan-Willem Maessen. ''Eager Haskell: Resource-bounded execution yields efficient iteration''. Proceedings of the 2002 [[Association for Computing Machinery]] (ACM) SIGPLAN workshop on Haskell.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Simon Peyton Jones. [http://research.microsoft.com/~simonpj/papers/haskell-retrospective ''Wearing the hair shirt: a retrospective on Haskell'']. Invited talk at [[POPL]] 2003.&amp;lt;/ref&amp;gt; In addition to purely practical considerations such as improved performance,&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/pipermail/haskell/2006-June/018127.html|title=Lazy evaluation can lead to excellent performance, such as in The Computer Language Benchmarks Game}}&amp;lt;/ref&amp;gt; they note that, in addition to adding some performance overhead, lazy evaluation makes it more difficult for programmers to reason about the performance of their code (particularly its space use).&lt;br /&gt;
&lt;br /&gt;
Bastiaan Heeren, Daan Leijen, and Arjan van IJzendoorn in 2003 also observed some stumbling blocks for Haskell learners: &amp;quot;The subtle syntax and sophisticated type system of Haskell are a double edged sword – highly appreciated by experienced programmers but also a source of frustration among beginners, since the generality of Haskell often leads to cryptic error messages.&amp;quot;&amp;lt;ref&amp;gt;{{cite journal|first1=Bastiaan |last1=Heeren |first2=Daan |last2=Leijen |first3=Arjan |last3=van IJzendoorn|year=2003|title=Helium, for learning Haskell|journal=Proceedings of the 2003 [[Association for Computing Machinery|ACM]] [[SIGPLAN]] workshop on Haskell|url=http://www.cs.uu.nl/~bastiaan/heeren-helium.pdf}}&amp;lt;/ref&amp;gt; To address these, researchers from Utrecht University developed an advanced interpreter called [[Helium (Haskell)|Helium]], which improved the user-friendliness of error messages by limiting the generality of some Haskell features, and in particular removing support for [[type class]]es.&lt;br /&gt;
&lt;br /&gt;
Ben Lippmeier designed Disciple&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/haskellwiki/DDC |title=DDC – HaskellWiki |publisher=Haskell.org |date=2010-12-03 |accessdate=2013-06-26}}&amp;lt;/ref&amp;gt; as a [[evaluation strategy|strict-by-default]] (lazy by explicit annotation) dialect of Haskell with a type-and-effect system, to address Haskell's difficulties in reasoning about lazy evaluation and in using traditional data structures such as mutable arrays.&amp;lt;ref&amp;gt;Ben Lippmeier, [http://www.cse.unsw.edu.au/~benl/papers/thesis/lippmeier-impure-world.pdf Type Inference and Optimisation for an Impure World], [[Australian National University]] (2010) PhD thesis, chapter 1&amp;lt;/ref&amp;gt;  He argues (p.&amp;amp;nbsp;20) that &amp;quot;destructive update furnishes the programmer with two important and powerful tools&amp;amp;nbsp;... a set of efficient array-like data structures for managing collections of objects, and ... the ability to broadcast a new value to all parts of a program with minimal burden on the programmer.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Robert Harper (computer scientist)|Robert Harper]], one of the authors of [[Standard ML]], has given his reasons for not using Haskell to teach introductory programming. Among these are the difficulty of reasoning about resource use with non-strict evaluation, that lazy evaluation complicates the definition of data types and inductive reasoning,&amp;lt;ref&amp;gt;{{cite web|url=http://existentialtype.wordpress.com/2011/04/24/the-real-point-of-laziness/|title=The point of laziness|author=Robert Harper}}&lt;br /&gt;
&amp;lt;/ref&amp;gt; and the &amp;quot;inferiority&amp;quot; of Haskell's (old) class system compared to ML's module system.&amp;lt;ref&amp;gt;{{cite web|url=http://existentialtype.wordpress.com/2011/04/16/modules-matter-most/|author=Robert Harper|title=Modules matter most.}}&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It was consistently criticised  by developers due to the lack of good management of different versions of a particular library by default build tool, Cabal, in a [[dll hell]]. This has been addressed&amp;lt;ref&amp;gt;[https://www.haskell.org/communities/05-2017/report.pdf Haskell Communities and Activities Report, 32nd ed. May 2017, p. 17: Stack Build Tool, January 2015]&amp;lt;/ref&amp;gt; by the release of the [[Stack (Haskell)|Stack]], which manages cabal, to do the work in a build.&lt;br /&gt;
&lt;br /&gt;
Although Haskell has copious educational and conceptual type examples, frequently illustrated with the Integer and String types, their use is not the only way to program in Haskell; Integer type can be replaced, with Int or Word when performance is needed, and String type can be replaced with Text type to handle real-world situations more prudently.&amp;lt;ref&amp;gt;[ ''Real-World Haskell'' ]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Related languages==&lt;br /&gt;
[[Clean (programming language)|Clean]] is a close, slightly older relative of Haskell. Its biggest deviation from Haskell is in the use of [[uniqueness type]]s instead of monads for I/O and side-effects.&lt;br /&gt;
&lt;br /&gt;
A series of languages inspired by Haskell, but with different type systems, have been developed, including:&lt;br /&gt;
* [[Agda (theorem prover)|Agda]], a functional language with [[dependent type]]s&lt;br /&gt;
* [[Idris (programming language)|Idris]], a general purpose functional language with [[dependent type]]s, developed at the [[University of St Andrews]]&lt;br /&gt;
* [[Epigram (programming language)|Epigram]], a functional language with dependent types suitable for proving properties of programs&lt;br /&gt;
* [[Cayenne (programming language)|Cayenne]], with [[dependent type]]s&lt;br /&gt;
* [[Ωmega]], strict and more&lt;br /&gt;
* [[Elm (programming language)|Elm]], a functional  language to create web front-end apps, no support for higher-kinded types&lt;br /&gt;
&lt;br /&gt;
[[Java virtual machine]] (JVM) based:&lt;br /&gt;
* [[Frege (programming language)|Frege]], a Haskell-like language with Java's [[Scalar (computing)|scalar]] types and good Java integration.&amp;lt;ref name=&amp;quot;frege&amp;quot;&amp;gt;{{cite web|url=http://fregepl.blogspot.com|title=Frege Programming Language|publisher=}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;frege-wiki&amp;quot;&amp;gt;{{cite web|url=http://code.google.com/p/frege/|title=Google Code Archive - Long-term storage for Google Code Project Hosting.|publisher=}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|url=http://mmhelloworld.blogspot.com.es/2012/02/hello-world-frege.html|title=mmhelloworld|author=Marimuthu Madasamy|publisher=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[Jaskell]], a functional [[scripting language]] that runs in Java VM.&amp;lt;ref&amp;gt;{{cite web|url=http://jaskell.codehaus.org/|title=Codehaus|publisher=|deadurl=yes|archiveurl=https://web.archive.org/web/20060220023022/http://jaskell.codehaus.org/|archivedate=20 February 2006|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Eta-lang, which intends to be Haskell on the JVM&lt;br /&gt;
&lt;br /&gt;
Other related languages include:&lt;br /&gt;
* [[Curry (programming language)|Curry]], a functional/logic programming language based on Haskell&lt;br /&gt;
&lt;br /&gt;
Haskell has served as a testbed for many new ideas in language design. There have been many Haskell variants produced, exploring new language ideas, including:&lt;br /&gt;
* Parallel Haskell:&lt;br /&gt;
** From [[Glasgow University]], supports clusters of machines or single multiprocessors.&amp;lt;ref&amp;gt;{{cite web|url=http://www.macs.hw.ac.uk/~dsg/gph/|title=Glasgow Parallel Haskell|publisher=}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/ghc/docs/6.6/html/users_guide/lang-parallel.html|title=7.15.&amp;amp;nbsp;Parallel Haskell|publisher=}}&amp;lt;/ref&amp;gt; Also within Haskell is support for Symmetric Multiprocessor parallelism.&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/ghc/docs/6.6/html/users_guide/sec-using-smp.html|title=4.12.&amp;amp;nbsp;Using SMP parallelism|publisher=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
** From [[Massachusetts Institute of Technology|MIT]]&amp;lt;ref&amp;gt;{{cite web|url=http://csg.csail.mit.edu/projects/languages/ph.shtml|title=Computation Structures Group- MIT- LCS|author=Todd Allen Amicon|publisher=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Distributed Haskell (formerly Goffin) and Eden.{{Citation needed|date=April 2009}}&lt;br /&gt;
* Eager Haskell, based on [[speculative execution|speculative evaluation]].&lt;br /&gt;
* Several [[object-oriented programming|object-oriented]] versions: Haskell++, and Mondrian.&lt;br /&gt;
* [[generic programming#Generic Haskell|Generic Haskell]], a version of Haskell with type system support for [[generic programming]].&lt;br /&gt;
* O'Haskell, an extension of Haskell adding [[object-oriented programming|object-orientation]] and [[concurrent programming]] support that &amp;quot;has ... been superseded by [[Timber (programming language)|Timber]]&amp;quot;.&amp;lt;ref&amp;gt;{{cite web|url=http://www.haskell.org/haskellwiki/O%27Haskell|title=O'Haskell|publisher=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
* Disciple, a strict-by-default (laziness available by annotation) dialect of Haskell that supports destructive update, computational effects, type directed field projections and allied functional aspects.&lt;br /&gt;
* [[Hume (programming language)|Hume]], a strict functional language for [[embedded system]]s based on processes as stateless automata over a sort of tuples of one element mailbox channels where the state is kept by feedback into the mailboxes, and a mapping description from outputs to channels as box wiring, with a Haskell-like expression language and syntax.&lt;br /&gt;
&lt;br /&gt;
==Conferences and workshops==&lt;br /&gt;
The Haskell community meets regularly for research and development activities. The main events are:&lt;br /&gt;
* [[International Conference on Functional Programming]] (ICFP)&lt;br /&gt;
* [[Haskell Symposium]] (formerly the Haskell Workshop)&lt;br /&gt;
* Haskell Implementors Workshop&lt;br /&gt;
* [[Commercial Users of Functional Programming]] (CUFP)&lt;br /&gt;
&lt;br /&gt;
Since 2006, a series of organized ''hackathons'' has occurred, the Hac series, aimed at improving the programming language tools and libraries.&amp;lt;ref&amp;gt;{{cite web |title=Hackathon – HaskellWiki |url=http://haskell.org/haskellwiki/Hackathon}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--per talk == Haskell Base library and algebra ==&lt;br /&gt;
{{manual|date=September 2018|section}}&lt;br /&gt;
{{primary sources|date=September 2018|section}}&lt;br /&gt;
&lt;br /&gt;
As Haskell separates domains (types) and behaviour ([[type class]]es) you may find correspondences with the algebra world that underlies the standard typeclasses of the Haskell basic library.&lt;br /&gt;
&lt;br /&gt;
The ''Num'' class has the operation signatures required for a [[Ring (mathematics)|Ring]], except for the (+) and (*) neutral elements, which are predefined as literals.&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Num The Num type class]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Operation laws like (+) and (*) associativity and addition commutativity are not related with the typeclass, but rather proofs to be checked on the instances.&lt;br /&gt;
 &lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
$ ghci&lt;br /&gt;
Prelude&amp;gt; :type 0&lt;br /&gt;
0 :: Num a =&amp;gt; a         -- 0 belongs to any type that has a Num instance, a Ring&lt;br /&gt;
Prelude&amp;gt; :type 1&lt;br /&gt;
1 :: Num a =&amp;gt; a         -- neutral for the product of a type that implements Num&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The ''Word'' data types (Word, WordN) implement the ''Num'' type class with [[modular arithmetic]] whereas the data types Int and IntN use [[two's complement]] [[arithmetic]] that does not match the [[decimal arithmetic]] (see [[Integer overflow]]):{{discuss}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
Prelude&amp;gt; (signum maxBound ::Int) == signum (maxBound +1)    &lt;br /&gt;
False -- ??? maxBound successor doesn't obey arithmetic rule  (it doesn't throw exceptions)&lt;br /&gt;
&lt;br /&gt;
Prelude&amp;gt; (signum maxBound ::Int) == signum (maxBound *2)    &lt;br /&gt;
False -- ??? Int product overflow (no exceptions either)&lt;br /&gt;
&lt;br /&gt;
Prelude&amp;gt; (-minBound ::Int) /= minBound  -- where Int minBound == sign bit set followed by zeros&lt;br /&gt;
False   -- ??? Negate overflow&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
Possible workarounds to make it match with regular [[arithmetic]], throwing an exception on overflow, are&lt;br /&gt;
* to check the addition result for same ''signum'' {-1,0,1} with the operands when operand signs match;&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#v:signum Num typeclass ''signum'' function]&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;safe-int-addition&amp;quot;&amp;gt;[https://www.schoolofhaskell.com/user/griba/safe_int_addition_and_product SchoolOfHaskell.com - Safe Int addition and product]&amp;lt;/ref&amp;gt; or&lt;br /&gt;
* to perform the operation with unlimited precision, checking the typecasted result.&amp;lt;ref name=&amp;quot;safe-int-addition&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The ''Fractional'' type class adds to Num the [[multiplicative inverse]] in the ''recip'' function (for &amp;quot;reciprocal&amp;quot;) and, as a consequence, the [[Division (mathematics)|division]]. It corresponds to a [[Field (mathematics)|Field]].&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Fractional The Fractional type class]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The ''Real'' type class requires Num and Ord, corresponds to an [[Ordered ring]],&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Real The Real type class]&amp;lt;/ref&amp;gt; which serves to [[Integer number]]s, [[Rational number|Rational]]&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Data-Ratio.html The Rational numbers module]&amp;lt;/ref&amp;gt; and [[Floating point]] numbers.&amp;lt;ref name=&amp;quot;prelude-float&amp;quot;&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Float The Float data type]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The ''Integral'' type class adds operations for [[Euclidean division]] to the required ''Real'' and ''Enum'' classes, corresponding to a [[Euclidean ring]], which is an [[integral ring]].&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Integral The Integral type class]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The ''Floating'' type class adds to ''Fractional'' the [[calculus]] functions (''sqrt'', [[trigonometric functions]], [[logarithm]]s) common to [[floating point]] (Float, Double) and [[Complex number|complex]] numbers.&amp;lt;ref name=&amp;quot;prelude-floating&amp;quot;&amp;gt;[http://hackage.haskell.org/package/base/docs/Prelude.html#t:Floating The Floating type class]&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;prelude-float&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;[http://hackage.haskell.org/package/base/docs/Data-Complex.html#t:Complex The Complex data type]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Exponentiation]] comes in three flavours:&lt;br /&gt;
&lt;br /&gt;
{{unordered list&lt;br /&gt;
| A positive integer exponent requires that the base domain has the product (specified in ''Num'', signature of a [[Ring (mathematics)|ring]]):&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
(^) :: (Num a, Integral ex) =&amp;gt; a -&amp;gt; ex -&amp;gt; a    -- (^) admits non-negative exponents of an euclidean domain, throws an error if the exponent is negative&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
| A negative integer exponent requires that the base domain has the [[multiplicative inverse]] (specified in ''Fractional'', signature of a [[Field (mathematics)|field]]):&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
(^^) :: (Fractional a, Integral ex) =&amp;gt; a -&amp;gt; ex -&amp;gt; a   -- (^^) admits all exponents of an euclidean domain&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
| A [[floating point]] exponent requires that the base domain has the floating point [[exponentiation]] and [[logarithm]] functions, as specified in the ''Floating'' type class:&amp;lt;ref name=&amp;quot;prelude-floating&amp;quot;/&amp;gt;&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
(**) :: (Floating a, Floating ex) =&amp;gt; a -&amp;gt; ex -&amp;gt; a&lt;br /&gt;
&amp;lt;/source&amp;gt;}}&lt;br /&gt;
&lt;br /&gt;
Conversions between Euclidean types preserve the representation, not the value. Numeric type downcasting does not throw an overflow exception:&lt;br /&gt;
&amp;lt;source lang=&amp;quot;haskell&amp;quot;&amp;gt;&lt;br /&gt;
$ ghci&lt;br /&gt;
Prelude&amp;gt; import Data.Int&lt;br /&gt;
Prelude Data.Int&amp;gt; fromIntegral (32767 :: Int16) :: Int8&lt;br /&gt;
-1&lt;br /&gt;
Prelude Data.Int&amp;gt; fromInteger (2^64 :: Integer) :: Int32&lt;br /&gt;
0&lt;br /&gt;
&amp;lt;/source&amp;gt;&lt;br /&gt;
per talk --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist|30em}}&lt;br /&gt;
&lt;br /&gt;
==Further reading==&lt;br /&gt;
; Reports&lt;br /&gt;
* {{cite book| editor-first = Simon| editor-last = Peyton Jones| editor-link = Simon Peyton Jones| title = Haskell 98 Language and Libraries: The Revised Report| url = http://haskell.org/onlinereport/| year = 2003| publisher = Cambridge University Press| isbn = 0521826144| ref = harv}}&lt;br /&gt;
* {{cite book| editor-first = Simon| editor-last = Marlow| editor-link = Simon Marlow| title = Haskell 2010 Language Report| url= https://www.haskell.org/definition/haskell2010.pdf| year = 2010| publisher = Haskell.org | ref = harv}}&lt;br /&gt;
; Textbooks&lt;br /&gt;
*{{cite book|first=Antony|last=Davie|title=An Introduction to Functional Programming Systems Using Haskell|publisher=Cambridge University Press|year=1992|isbn=0-521-25830-8}}&lt;br /&gt;
*{{cite book|first=Richard|last=Bird|authorlink=Richard Bird (computer scientist)|title=Introduction to Functional Programming using Haskell|edition=2nd|publisher=Prentice Hall Press|year=1998|isbn=0-13-484346-0|url=http://www.cs.ox.ac.uk/publications/books/functional/}}&lt;br /&gt;
*{{cite book|first=Paul|last=Hudak|authorlink=Paul Hudak|title=The Haskell School of Expression: Learning Functional Programming through Multimedia|publisher=Cambridge University Press|location=New York|year=2000|isbn=0521643384|url=http://www.cs.yale.edu/homes/hudak/SOE/}}&lt;br /&gt;
*{{cite book|first=Graham|last=Hutton|authorlink=Graham Hutton|title=Programming in Haskell|year=2007|publisher=Cambridge University Press|isbn=0521692695|url=http://www.cs.nott.ac.uk/~gmh/book.html}}&lt;br /&gt;
*{{Cite book|first1=Bryan|last1=O'Sullivan|authorlink1=Bryan O'Sullivan (computer programmer)|first2=Don|last2=Stewart|authorlink2=Don Stewart (computer programmer)|last3=Goerzen|first3=John|authorlink3=John Goerzen|title=[[Real World Haskell]]|year=2008|publisher=O'Reilly|location=Sebastopol|isbn=0-596-51498-0|postscript=&amp;amp;nbsp;([http://book.realworldhaskell.org/read/ full text])}}&lt;br /&gt;
*{{cite book|first=Simon|last=Thompson|title=Haskell: The Craft of Functional Programming|edition=3rd|publisher=Addison-Wesley|year=2011|isbn=0201882957|url=http://www.haskellcraft.com/}}&lt;br /&gt;
*{{cite book|last=Lipovača|first=Miran |title=Learn You a Haskell for Great Good!|url=http://learnyouahaskell.com/|date=April 2011|publisher=No Starch Press|location=San Francisco|isbn=978-1-59327-283-8}} ([http://learnyouahaskell.com/chapters full text])&lt;br /&gt;
*{{cite book|first=Richard|last=Bird|authorlink=Richard Bird (computer scientist)|title=Thinking Functionally with Haskell |publisher=Cambridge University Press|year=2014|isbn= 978-1-107-45264-0}}&lt;br /&gt;
; Tutorials&lt;br /&gt;
*{{cite web|url=http://haskell.org/tutorial/|title=A Gentle Introduction To Haskell, Version 98|date=June 2000|first1=Paul |last1=Hudak |first2=John |last2=Peterson |first3=Joseph |last3=Fasel|work=Haskell.org}}&lt;br /&gt;
*[http://hal3.name/docs/daume02yaht.pdf Yet Another Haskell Tutorial], by Hal Daumé III; assumes far less prior knowledge than official tutorial&lt;br /&gt;
*{{Cite journal|last=Yorgey|first=Brent|date=12 March 2009|title=The Typeclassopedia|journal=The Monad.Reader|issue=13|pages=17–68|url=http://www.haskell.org/wikiupload/8/85/TMR-Issue13.pdf|postscript=&amp;lt;!-- Bot inserted parameter. Either remove it; or change its value to &amp;quot;.&amp;quot; for the cite to end in a &amp;quot;.&amp;quot;, as needed. --&amp;gt;{{inconsistent citations}}}}&lt;br /&gt;
; History&lt;br /&gt;
* {{cite journal| first1 = Paul| last1 = Hudak| authorlink1 = Paul Hudak| first2 = John| last2 = Hughes| authorlink2 = John Hughes (computer scientist)| first3 = Simon| last3 = Peyton Jones| authorlink3 = Simon Peyton Jones| first4 = Philip| last4 = Wadler| authorlink4 = Philip Wadler| title = A History of Haskell: Being Lazy with Class| url = http://research.microsoft.com/~simonpj/papers/history-of-haskell/history.pdf | doi = 10.1145/1238844.1238856| year = 2007| journal = Proceedings of the third ACM [[SIGPLAN]] conference on History of programming languages ([[HOPL]] III)| pages = 12-1–55| isbn = 978-1-59593-766-7|ref=harv}}&lt;br /&gt;
* {{cite journal|last=Hamilton|first=Naomi|date=19 September 2008|title=The A-Z of Programming Languages: Haskell|journal=[[Computerworld]]|url=http://www.computerworld.com.au/article/261007/a-z_programming_languages_haskell/}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
{{Wikibooks|Haskell}}&lt;br /&gt;
{{Wikibooks|Write Yourself a Scheme in 48 Hours}}&lt;br /&gt;
*{{Official website}}&lt;br /&gt;
*[https://wiki.haskell.org/ Haskell Wiki]&lt;br /&gt;
*[https://planet.haskell.org/ Planet Haskell] an aggregator of Haskell related blogs and other Haskell-related news sites&lt;br /&gt;
*[http://hackage.haskell.org/ Hackage] – central package archive&lt;br /&gt;
*[https://www.haskell.org/hoogle/ Hoogle] – API search engine&lt;br /&gt;
*[http://tryhaskell.org/ Try Haskell!] – in-browser interactive tutorial&lt;br /&gt;
*[https://www.fpcomplete.com/school School of Haskell] – online tutorials&lt;br /&gt;
*[http://adit.io/posts/2013-04-17-functors,_applicatives,_and_monads_in_pictures.html Functors, Applicatives, And Monads In Pictures]&lt;br /&gt;
*[http://book.realworldhaskell.org/read/ Real World Haskell] - free to read online&lt;br /&gt;
*[http://www.willamette.edu/~fruehr/haskell/evolution.html The Evolution of a Haskell Programmer] – slightly humorous overview of different programming styles in Haskell&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
{{use dmy dates|date=March 2012}}&lt;br /&gt;
&lt;br /&gt;
{{Programming languages}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Academic programming languages]]&lt;br /&gt;
[[Category:Articles with example Haskell code]]&lt;br /&gt;
[[Category:Educational programming languages]]&lt;br /&gt;
[[Category:Functional languages]]&lt;br /&gt;
[[Category:Haskell programming language family| ]]&lt;br /&gt;
[[Category:Literate programming]]&lt;br /&gt;
[[Category:Pattern matching programming languages]]&lt;br /&gt;
[[Category:Programming languages created in 1990]]&lt;br /&gt;
[[Category:Statically typed programming languages]]&lt;/div&gt;</summary>
		<author><name>Ihatehumans</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Haskell&amp;diff=1476638</id>
		<title>Haskell</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Haskell&amp;diff=1476638"/>
		<updated>2018-12-23T22:45:59Z</updated>

		<summary type="html">&lt;p&gt;Ihatehumans: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Haskell'''  is a pure [[functional programming languages|functional programming language]] with roots in [[category theory]].  Free and [[open source]] implementations are available for a variety of operating systems.&lt;br /&gt;
&lt;br /&gt;
==Functions in Haskell==&lt;br /&gt;
&lt;br /&gt;
Functions are the most important structure in Haskell. A function takes a single value as input and returns a single value as output. Clearly it is often desirable to take in more than one argument or give out more than one. This can be done using [[tuples]] or [[lists]] but there is a very mathematically elegant and useful method called [[currying]], named for the logician Haskell Curry.&lt;br /&gt;
&lt;br /&gt;
Functions in Haskell are also values in themselves, allowing Haskell to use [[higher-order functions]].&lt;br /&gt;
&lt;br /&gt;
== Hello World ==&lt;br /&gt;
&lt;br /&gt;
 (display &amp;quot;hello world\n&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
===External links===&lt;br /&gt;
* [http://www.haskell.org  The HaskellWiki]&lt;br /&gt;
&lt;br /&gt;
[[Category:Programming Languages]]&lt;/div&gt;</summary>
		<author><name>Ihatehumans</name></author>
	</entry>
</feed>