Programming language theory - Revision history

Jerryobject: /* Journals, publications, and conferences */ Nonlead-word nonproper noun MOS:CAPS > WP:LOWERCASE sentence case. Move or cut needless WP:ITALICs.

2025-04-21T05:07:46Z

Journals, publications, and conferences: Nonlead-word nonproper noun MOS:CAPS > WP:LOWERCASE sentence case. Move or cut needless WP:ITALICs.

← Previous revision		Revision as of 05:07, 21 April 2025
Line 85:		Line 85:

	== Journals, publications, and conferences ==		== Journals, publications, and conferences ==
	Conferences are the primary venue for presenting research in programming languages. The most well known conferences include the ''[[Symposium on Principles of Programming Languages]]'' (POPL), ''[[Programming Language Design and Implementation (conference)\|Programming Language Design and Implementation]]'' (PLDI), the ''[[International Conference on Functional Programming]]'' (ICFP), ''the ~~International~~ ~~Conference~~ on Object Oriented Programming, Systems, Languages ~~and~~ Applications'' ([[OOPSLA]]) and ''~~the~~ [[International Conference on Architectural Support for Programming Languages and Operating Systems]]'' (ASPLOS)''.''		Conferences are the primary venue for presenting research in programming languages. The most well known conferences include the ''[[Symposium on Principles of Programming Languages]]'' (POPL), ''[[Programming Language Design and Implementation (conference)\|Programming Language Design and Implementation]]'' (PLDI), the ''[[International Conference on Functional Programming]]'' (ICFP), the international conference on ''Object-Oriented Programming, Systems, Languages & Applications'' ([[OOPSLA]]) and the ''[[International Conference on Architectural Support for Programming Languages and Operating Systems]]'' (ASPLOS).

	Notable journals that publish PLT research include the ''[[ACM Transactions on Programming Languages and Systems]]'' (TOPLAS), ''[[Journal of Functional Programming]]'' (JFP), ''[[Journal of Functional Programming\|Journal of Functional and Logic Programming]]'', and ''[[Higher-Order and Symbolic Computation]]''.		Notable journals that publish PLT research include the ''[[ACM Transactions on Programming Languages and Systems]]'' (TOPLAS), ''[[Journal of Functional Programming]]'' (JFP), ''[[Journal of Functional Programming\|Journal of Functional and Logic Programming]]'', and ''[[Higher-Order and Symbolic Computation]]''.

Jerryobject: WP:REFerence WP:CITation parameters: update-standardize-conform, reorders, adds, fills. WP:LINKs: adds, update-standardizes, needless WP:PIPEs > WP:NOPIPEs, WP:RED until article exists. Small WP:COPYEDITs WP:EoS: WP:TERSE, clarify. MOS:FIRSTABBReviations clarify, define before parenthetic WP:ABBRs.

2025-04-21T04:40:04Z

WP:REFerence WP:CITation parameters: update-standardize-conform, reorders, adds, fills. WP:LINKs: adds, update-standardizes, needless WP:PIPEs > WP:NOPIPEs, WP:RED until article exists. Small WP:COPYEDITs WP:EoS: WP:TERSE, clarify. MOS:FIRSTABBReviations clarify, define before parenthetic WP:ABBRs.

Show changes

Abdelbari Bougoffa at 16:56, 18 February 2025

2025-02-18T16:56:12Z

← Previous revision		Revision as of 16:56, 18 February 2025
Line 9:		Line 9:
	{{see also\|History of programming languages\|Programming language#History}}		{{see also\|History of programming languages\|Programming language#History}}

	In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by Alonzo Church and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.		In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by [[Alonzo Church]] and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.

	The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran\|FORTRAN]] (Stands for Formula Translation), developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.		The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran\|FORTRAN]] (Stands for Formula Translation), developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.

Ringo62: Generic, uninformative statement, not worth mentioning in the lead section

2025-02-01T10:58:38Z

Generic, uninformative statement, not worth mentioning in the lead section

← Previous revision		Revision as of 10:58, 1 February 2025
Line 4:		Line 4:
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]

	'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]~~. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area~~.		'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]].

	== History ==		== History ==

Echo Kon: added FORTRAN full form

2024-10-05T12:51:36Z

added FORTRAN full form

← Previous revision		Revision as of 12:51, 5 October 2024
Line 11:		Line 11:
	In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by Alonzo Church and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.		In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by Alonzo Church and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.

	The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran]], developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.		The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran\|FORTRAN]] (Stands for Formula Translation), developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.

	===Timeline===		===Timeline===

197.27.202.99 at 10:45, 11 June 2024

2024-06-11T10:45:04Z

← Previous revision		Revision as of 10:45, 11 June 2024
Line 22:		Line 22:

	; 1960s		; 1960s
	* ~~The~~ [[Simula]] language was developed by [[Ole-Johan Dahl]] and [[Kristen Nygaard]]; it is widely considered to be the first example of an [[object-oriented programming language]]; Simula also introduced the concept of [[coroutine]]s.		* In 1962, the [[Simula]] language was developed by [[Ole-Johan Dahl]] and [[Kristen Nygaard]]; it is widely considered to be the first example of an [[object-oriented programming language]]; Simula also introduced the concept of [[coroutine]]s.
	* In 1964, [[Peter Landin]] is the first to realize Church's lambda calculus can be used to model programming languages. He introduces the [[SECD machine]] which "interprets" lambda expressions.		* In 1964, [[Peter Landin]] is the first to realize Church's lambda calculus can be used to model programming languages. He introduces the [[SECD machine]] which "interprets" lambda expressions.
	* In 1965, Landin introduces the [[J operator]], essentially a form of [[continuation]].		* In 1965, Landin introduces the [[J operator]], essentially a form of [[continuation]].

David Eppstein: Reverted edits by Thiagovscoelho (talk) to last version by Hamled

2024-03-23T18:33:03Z

Reverted edits by Thiagovscoelho (talk) to last version by Hamled

← Previous revision		Revision as of 18:33, 23 March 2024
Line 3:		Line 3:
	{{More footnotes \|date=October 2015}}		{{More footnotes \|date=October 2015}}
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]

	{{Formal languages}}
	'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.		'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.

Thiagovscoelho at 15:23, 23 March 2024

2024-03-23T15:23:50Z

← Previous revision		Revision as of 15:23, 23 March 2024
Line 2:		Line 2:
	{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}		{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}
	{{More footnotes \|date=October 2015}}		{{More footnotes \|date=October 2015}}
⚫	{{Formal languages}}
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]
		⚫	{{Formal languages}}

	'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.		'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.

Thiagovscoelho at 15:23, 23 March 2024

2024-03-23T15:23:35Z

← Previous revision		Revision as of 15:23, 23 March 2024
Line 2:		Line 2:
	{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}		{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}
	{{More footnotes \|date=October 2015}}		{{More footnotes \|date=October 2015}}
			{{Formal languages}}
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]

Hamled: Update link to "Selected Papers on Computer Languages" reference in Further reading.

2024-02-10T00:06:12Z

Update link to "Selected Papers on Computer Languages" reference in Further reading.

← Previous revision		Revision as of 00:06, 10 February 2024
Line 102:		Line 102:
	* Gunter, Carl and [[John C. Mitchell\|Mitchell, John C.]] (eds.). ''Theoretical Aspects of Object Oriented Programming Languages: Types, Semantics, and Language Design''. MIT Press.		* Gunter, Carl and [[John C. Mitchell\|Mitchell, John C.]] (eds.). ''Theoretical Aspects of Object Oriented Programming Languages: Types, Semantics, and Language Design''. MIT Press.
	* [[Robert Harper (computer scientist)\|Harper, Robert]]. ''[https://web.archive.org/web/20070627041059/https://www.cs.cmu.edu/~rwh/plbook/book.pdf Practical Foundations for Programming Languages]''. Draft version.		* [[Robert Harper (computer scientist)\|Harper, Robert]]. ''[https://web.archive.org/web/20070627041059/https://www.cs.cmu.edu/~rwh/plbook/book.pdf Practical Foundations for Programming Languages]''. Draft version.
	* [[Donald Knuth\|Knuth, Donald E.]] (2003). ''[http://www-cs-faculty.stanford.edu/~~~uno~~/cl.html Selected Papers on Computer Languages]''. Stanford, California: Center for the Study of Language and Information.		* [[Donald Knuth\|Knuth, Donald E.]] (2003). ''[http://www-cs-faculty.stanford.edu/~knuth/cl.html Selected Papers on Computer Languages]''. Stanford, California: Center for the Study of Language and Information.
	* [[John C. Mitchell\|Mitchell, John C.]] ''Foundations for Programming Languages''.		* [[John C. Mitchell\|Mitchell, John C.]] ''Foundations for Programming Languages''.
	* [[John C. Mitchell\|Mitchell, John C.]] ''Introduction to Programming Language Theory''.		* [[John C. Mitchell\|Mitchell, John C.]] ''Introduction to Programming Language Theory''.

← Previous revision		Revision as of 16:56, 18 February 2025
Line 9:		Line 9:
	{{see also\|History of programming languages\|Programming language#History}}		{{see also\|History of programming languages\|Programming language#History}}

	In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by Alonzo Church and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.		In some ways, the history of programming language theory predates even the development of programming languages themselves. The [[lambda calculus]], developed by [[Alonzo Church]] and [[Stephen Cole Kleene]] in the 1930s, is considered by some to be the world's first programming language, even though it was intended to [[Model of computation\|''model'']] computation rather than being a means for programmers to [[Computer programming\|''describe'']] algorithms to a computer system. Many modern [[functional programming language]]s have been described as providing a "thin veneer" over the lambda calculus,<ref>{{Cite web \|date=December 3, 2014 \|title=Models Of Computation \|url=http://www.c2.com/cgi/wiki?ModelsOfComputation \|url-status=live \|archive-url=https://web.archive.org/web/20201130055927/http://wiki.c2.com/?ModelsOfComputation \|archive-date=Nov 30, 2020 \|website=wiki.c2.com}}</ref> and many are easily described in terms of it.

	The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran\|FORTRAN]] (Stands for Formula Translation), developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.		The first programming language to be invented was [[Plankalkül]], which was designed by [[Konrad Zuse]] in the 1940s, but not publicly known until 1972 (and not implemented until 1998). The first widely known and successful [[high-level programming language]] was [[Fortran\|FORTRAN]] (Stands for Formula Translation), developed from 1954 to 1957 by a team of [[IBM]] researchers led by [[John Backus]]. The success of FORTRAN led to the formation of a committee of scientists to develop a "universal" computer language; the result of their effort was [[ALGOL 58]]. Separately, [[John McCarthy (computer scientist)\|John McCarthy]] of [[MIT]] developed [[Lisp (programming language)\|Lisp]], the first language with origins in academia to be successful. With the success of these initial efforts, programming languages became an active topic of research in the 1960s and beyond.

← Previous revision		Revision as of 18:33, 23 March 2024
Line 3:		Line 3:
	{{More footnotes \|date=October 2015}}		{{More footnotes \|date=October 2015}}
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]

	{{Formal languages}}
	'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.		'''Programming language theory''' ('''PLT''') is a branch of [[computer science]] that deals with the design, implementation, analysis, characterization, and classification of [[formal language]]s known as [[programming language]]s. Programming language theory is closely related to other fields including [[mathematics]], [[software engineering]], and [[linguistics]]. There are a number of [[academic conference]]s and [[academic journal\|journals]] in the area.

← Previous revision		Revision as of 15:23, 23 March 2024
Line 2:		Line 2:
	{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}		{{Redirect \|Theory of programming\|the branch of CS that deals with what problems can be solved\|Theory of computation}}
	{{More footnotes \|date=October 2015}}		{{More footnotes \|date=October 2015}}
			{{Formal languages}}
	[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]		[[File:Lambda lc.svg\|thumb\|250px\|The lowercase [[Greek alphabet\|Greek]] letter λ ([[lambda]]) is an unofficial symbol of the field of programming-language theory.{{Citation needed\|date= July 2020}} This usage derives from the [[lambda calculus]], a [[model of computation]] introduced by [[Alonzo Church]] in the 1930s and widely used by programming-language researchers. It graces the cover<ref>{{Cite book \|last=Abelson \|first=Harold \|url=https://www.worldcat.org/oclc/34576857 \|title=Structure and Interpretation of Computer Programs \|date=1996 \|publisher=MIT Press \|others=Gerald Jay Sussman, Julie Sussman \|isbn=0-262-01153-0 \|edition=2nd \|location=Cambridge, Mass. \|oclc=34576857}}</ref> of the classic text ''[[Structure and Interpretation of Computer Programs]]'', and the title of the so-called [[Lambda Papers]] of 1975 to 1980, written by [[Gerald Jay Sussman]] and [[Guy Steele]], the developers of the [[Scheme (programming language)\|Scheme programming language]].{{Technical statement\|date=July 2020}}]]

← Previous revision		Revision as of 00:06, 10 February 2024
Line 102:		Line 102:
	* Gunter, Carl and [[John C. Mitchell\|Mitchell, John C.]] (eds.). ''Theoretical Aspects of Object Oriented Programming Languages: Types, Semantics, and Language Design''. MIT Press.		* Gunter, Carl and [[John C. Mitchell\|Mitchell, John C.]] (eds.). ''Theoretical Aspects of Object Oriented Programming Languages: Types, Semantics, and Language Design''. MIT Press.
	* [[Robert Harper (computer scientist)\|Harper, Robert]]. ''[https://web.archive.org/web/20070627041059/https://www.cs.cmu.edu/~rwh/plbook/book.pdf Practical Foundations for Programming Languages]''. Draft version.		* [[Robert Harper (computer scientist)\|Harper, Robert]]. ''[https://web.archive.org/web/20070627041059/https://www.cs.cmu.edu/~rwh/plbook/book.pdf Practical Foundations for Programming Languages]''. Draft version.
	* [[Donald Knuth\|Knuth, Donald E.]] (2003). ''[http://www-cs-faculty.stanford.edu/~~~uno~~/cl.html Selected Papers on Computer Languages]''. Stanford, California: Center for the Study of Language and Information.		* [[Donald Knuth\|Knuth, Donald E.]] (2003). ''[http://www-cs-faculty.stanford.edu/~knuth/cl.html Selected Papers on Computer Languages]''. Stanford, California: Center for the Study of Language and Information.
	* [[John C. Mitchell\|Mitchell, John C.]] ''Foundations for Programming Languages''.		* [[John C. Mitchell\|Mitchell, John C.]] ''Foundations for Programming Languages''.
	* [[John C. Mitchell\|Mitchell, John C.]] ''Introduction to Programming Language Theory''.		* [[John C. Mitchell\|Mitchell, John C.]] ''Introduction to Programming Language Theory''.