Concurrent programming language - Revision history

The Transhumanist: Add template{{R to section}} to categorize redirect using AWB

2018-04-29T09:43:52Z

Add template{{R to section}} to categorize redirect using AWB

← Previous revision		Revision as of 09:43, 29 April 2018
Line 1:		Line 1:
			#REDIRECT [[Concurrent computing#Concurrent programming languages]]
	#redirect [[Concurrent_computing#Concurrent_programming_languages]]

			{{R to section}}

MaD70: Redirect to "Concurrent programming languages" section of "Concurrent computing".

2010-03-28T16:12:25Z

Redirect to "Concurrent programming languages" section of "Concurrent computing".

← Previous revision		Revision as of 16:12, 28 March 2010
Line 1:		Line 1:
	#redirect [[~~Concurrent computing~~]]		#redirect [[Concurrent_computing#Concurrent_programming_languages]]

MaD70: Undid revision 169783767 by Raul654 (talk) Concurrent programming is not the same thing as parallel programming.

2010-03-28T16:08:48Z

Undid revision 169783767 by Raul654 (talk) Concurrent programming is not the same thing as parallel programming.

← Previous revision		Revision as of 16:08, 28 March 2010
Line 1:		Line 1:
	#~~REDIRECT~~ [[~~Parallel~~ computing]]		#redirect [[Concurrent computing]]

Raul654: #REDIRECT Parallel computing

2007-11-07T04:29:56Z

#REDIRECT Parallel computing

← Previous revision		Revision as of 04:29, 7 November 2007
Line 1:		Line 1:
	#~~redirect~~ [[~~Concurrent~~ computing]]		#REDIRECT [[Parallel computing]]

Allan McInnes: merge into Concurrent computing

2006-01-27T05:11:51Z

merge into Concurrent computing

← Previous revision		Revision as of 05:11, 27 January 2006
Line 1:		Line 1:
	~~{{merge\|~~Concurrent computing}}		#redirect [[Concurrent computing]]

	'''Concurrent programming languages''' are [[programming languages]] that use language constructs for [[Concurrency (computer science)\|concurrency]]. These constructs may involve [[multi-threading]], support for [[distributed computing]], [[message passing programming\|message passing]], [[sharing\|shared resources]] (including [[Parallel Random Access Machine\|shared memory]]) or [[Future (programming)\|futures]] (known also as ''promises'').

	In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:
	#Shared-memory communication, in which the concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.
	#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|occam]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[process calculi]].

	Today, the most commonly used programming languages that have specific constructs for concurrency are [[Java programming language\|Java]] and [[C sharp\|C#]]. Both of these languages fundamentally use a shared-memory concurrency model, with locking provided by [[Monitor (synchronization)\|monitors]] (although message-passing models can and have been implemented on top of the underlying shared-memory model).

	Of the languages that use a message-passing concurrency model, [[Erlang programming language\|Erlang]] is probably the most widely used in industry at present.

	==Languages where concurrency is important==
	*[[Ada programming language\|Ada]]
	*[[Afnix programming language\|Afnix]] – concurrent access to data is protected automatically (previously called ''Aleph'', but unrelated to ''Alef'')
	*[[Alef programming language\|Alef]] – concurrent language with threads and message passing, used for systems programming in early versions of [[Plan 9 (operating system)]]
	*[[ChucK]] – domain specific programming language for audio
	*[[Cilk]] – a concurrent [[C programming language\|C]]
	*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication
	*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]
	*[[Corn programming language\|Corn]]
	*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur
	*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared
	*[[Join Java]] – concurrent language based on the [[Java programming language]]
	*[[Joule programming language\|Joule]] – dataflow language, communicates by message passing
	*[[Limbo programming language\|Limbo]] – relative of [[Alef programming language\|Alef]], used for systems programming in [[Inferno (operating system)]]
	*[[Oz_programming_language\|Oz]] – multiparadigm language, supports shared-state and message-passing concurrency, and futures
	**[[Mozart Programming System]] – [[multiplatform]] Oz
	*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism
	*[[Occam programming language\|occam]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).
	**[[Occam-Pi\|occam-π]] – a modern variant of [[Occam programming language\|occam]], which incorporates ideas from Milner's [[Pi-Calculus\|π-calculus]]
	*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus\|π-calculus]]
	*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet
	*[[SR language\|SR]] – research language

	Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and occam) have seen industrial use at various times in the last 20 years.

	Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).

	[[Category:Concurrent programming languages]]
	[[Category:Concurrent computing]]
	[[Category:Programming languages]]

	[[fr:Programmation concurrente]]

Allan McInnes: propose merge with Concurrent computing

2006-01-13T20:30:12Z

propose merge with Concurrent computing

← Previous revision		Revision as of 20:30, 13 January 2006
Line 1:		Line 1:
			{{merge\|Concurrent computing}}

	'''Concurrent programming languages''' are [[programming languages]] that use language constructs for [[Concurrency (computer science)\|concurrency]]. These constructs may involve [[multi-threading]], support for [[distributed computing]], [[message passing programming\|message passing]], [[sharing\|shared resources]] (including [[Parallel Random Access Machine\|shared memory]]) or [[Future (programming)\|futures]] (known also as ''promises'').		'''Concurrent programming languages''' are [[programming languages]] that use language constructs for [[Concurrency (computer science)\|concurrency]]. These constructs may involve [[multi-threading]], support for [[distributed computing]], [[message passing programming\|message passing]], [[sharing\|shared resources]] (including [[Parallel Random Access Machine\|shared memory]]) or [[Future (programming)\|futures]] (known also as ''promises'').

81.190.74.253: link changed

2006-01-02T21:35:14Z

link changed

← Previous revision		Revision as of 21:35, 2 January 2006
Line 17:		Line 17:
	*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication		*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication
	*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]		*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]
	*[[Corn ~~Programming~~ ~~Language~~\|Corn]]		*[[Corn programming language\|Corn]]
	*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur		*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur
	*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared		*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared

Allan McInnes: switch occam capitalization to standard form

2005-12-24T00:04:27Z

switch occam capitalization to standard form

← Previous revision		Revision as of 00:04, 24 December 2005
Line 3:		Line 3:
	In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:		In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:
	#Shared-memory communication, in which the concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.		#Shared-memory communication, in which the concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.
	#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|~~Occam~~]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[~~Process~~ calculi]].		#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|occam]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[process calculi]].

	Today, the most commonly used programming languages that have specific constructs for concurrency are [[Java programming language\|Java]] and [[C sharp\|C#]]. Both of these languages fundamentally use a shared-memory concurrency model, with locking provided by [[Monitor (synchronization)\|monitors]] (although message-passing models can and have been implemented on top of the underlying shared-memory model).		Today, the most commonly used programming languages that have specific constructs for concurrency are [[Java programming language\|Java]] and [[C sharp\|C#]]. Both of these languages fundamentally use a shared-memory concurrency model, with locking provided by [[Monitor (synchronization)\|monitors]] (although message-passing models can and have been implemented on top of the underlying shared-memory model).

Allan McInnes: /* Languages where concurrency is important */ revise occam capitalization to standard (lower case) form, and make 'pi' into a greek letter

2005-12-24T00:01:01Z

Languages where concurrency is important: revise occam capitalization to standard (lower case) form, and make 'pi' into a greek letter

← Previous revision		Revision as of 00:01, 24 December 2005
Line 26:		Line 26:
	**[[Mozart Programming System]] – [[multiplatform]] Oz		**[[Mozart Programming System]] – [[multiplatform]] Oz
	*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism		*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism
	*[[Occam programming language\|~~Occam~~]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).		*[[Occam programming language\|occam]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).
	**[[Occam-Pi\|~~Occam~~-pi]] – a modern variant of [[Occam programming language\|~~Occam~~]], which incorporates ideas from Milner's [[Pi-Calculus]]		**[[Occam-Pi\|occam-π]] – a modern variant of [[Occam programming language\|occam]], which incorporates ideas from Milner's [[Pi-Calculus\|π-calculus]]
	*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus]]		*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus\|π-calculus]]
	*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet		*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet
	*[[SR language\|SR]] – research language		*[[SR language\|SR]] – research language

	Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and ~~Occam~~) have seen industrial use at various times in the last 20 years.		Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and occam) have seen industrial use at various times in the last 20 years.

	Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).		Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).

203.196.179.70 at 14:01, 23 December 2005

2005-12-23T14:01:40Z

← Previous revision		Revision as of 14:01, 23 December 2005
Line 2:		Line 2:

	In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:		In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:
	#Shared-memory communication, in ~~the~~ which concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.		#Shared-memory communication, in which the concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.
	#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|Occam]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[Process calculi]].		#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|Occam]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[Process calculi]].

← Previous revision		Revision as of 05:11, 27 January 2006
Line 1:		Line 1:
	~~{{merge\|~~Concurrent computing}}		#redirect [[Concurrent computing]]

	'''Concurrent programming languages''' are [[programming languages]] that use language constructs for [[Concurrency (computer science)\|concurrency]]. These constructs may involve [[multi-threading]], support for [[distributed computing]], [[message passing programming\|message passing]], [[sharing\|shared resources]] (including [[Parallel Random Access Machine\|shared memory]]) or [[Future (programming)\|futures]] (known also as ''promises'').

	In some languages communication between concurrent parts of an application is hidden from the programmer (e.g., by using futures), while in others it must be handled explicitly. Explicit communication can be divided into two classes:
	#Shared-memory communication, in which the concurrent parts communicate by altering the contents of shared memory locations (exemplified by [[Java programming language\|Java]] and [[C sharp\|C#]]). This style of concurrent programming usually requires the application of some form of locking (e.g., [[Mutual exclusion\|mutexes]], [[Semaphore (programming)\|semaphores]], or [[Monitor (synchronization)\|monitors]]) to coordinate between threads.
	#Message-passing communication, in which concurrent parts communicate by exchanging messages (exemplified by [[Erlang programming language\|Erlang]] and [[Occam programming language\|occam]]). The exchange of messages may be carried out asynchronously (i.e. "send, pray, and if no acknowledgment send again"), or may use a rendezvous style in which the sender blocks until the message is received. Message-passing concurrency tends to be far easier to reason about than shared-memory concurrency, and is typically considered a more robust form of concurrent programming. A wide variety of mathematical theories for understanding and analyzing message-passing systems are available, including the [[Actor model]], and various [[process calculi]].

	Today, the most commonly used programming languages that have specific constructs for concurrency are [[Java programming language\|Java]] and [[C sharp\|C#]]. Both of these languages fundamentally use a shared-memory concurrency model, with locking provided by [[Monitor (synchronization)\|monitors]] (although message-passing models can and have been implemented on top of the underlying shared-memory model).

	Of the languages that use a message-passing concurrency model, [[Erlang programming language\|Erlang]] is probably the most widely used in industry at present.

	==Languages where concurrency is important==
	*[[Ada programming language\|Ada]]
	*[[Afnix programming language\|Afnix]] – concurrent access to data is protected automatically (previously called ''Aleph'', but unrelated to ''Alef'')
	*[[Alef programming language\|Alef]] – concurrent language with threads and message passing, used for systems programming in early versions of [[Plan 9 (operating system)]]
	*[[ChucK]] – domain specific programming language for audio
	*[[Cilk]] – a concurrent [[C programming language\|C]]
	*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication
	*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]
	*[[Corn programming language\|Corn]]
	*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur
	*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared
	*[[Join Java]] – concurrent language based on the [[Java programming language]]
	*[[Joule programming language\|Joule]] – dataflow language, communicates by message passing
	*[[Limbo programming language\|Limbo]] – relative of [[Alef programming language\|Alef]], used for systems programming in [[Inferno (operating system)]]
	*[[Oz_programming_language\|Oz]] – multiparadigm language, supports shared-state and message-passing concurrency, and futures
	**[[Mozart Programming System]] – [[multiplatform]] Oz
	*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism
	*[[Occam programming language\|occam]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).
	**[[Occam-Pi\|occam-π]] – a modern variant of [[Occam programming language\|occam]], which incorporates ideas from Milner's [[Pi-Calculus\|π-calculus]]
	*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus\|π-calculus]]
	*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet
	*[[SR language\|SR]] – research language

	Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and occam) have seen industrial use at various times in the last 20 years.

	Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).

	[[Category:Concurrent programming languages]]
	[[Category:Concurrent computing]]
	[[Category:Programming languages]]

	[[fr:Programmation concurrente]]

← Previous revision		Revision as of 21:35, 2 January 2006
Line 17:		Line 17:
	*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication		*[[Cω]] – C Omega, a research language extending C#, uses asynchronous communication
	*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]		*[[Concurrent Pascal programming language\|Concurrent Pascal]] – by [[Per Brinch Hansen\|Brinch-Hansen]]
	*[[Corn ~~Programming~~ ~~Language~~\|Corn]]		*[[Corn programming language\|Corn]]
	*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur		*[[E programming language\|E]] – uses promises, ensures deadlocks cannot occur
	*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared		*[[Erlang programming language\|Erlang]] – uses asynchronous message passing with nothing shared

← Previous revision		Revision as of 00:01, 24 December 2005
Line 26:		Line 26:
	**[[Mozart Programming System]] – [[multiplatform]] Oz		**[[Mozart Programming System]] – [[multiplatform]] Oz
	*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism		*[[MultiLisp]] – [[Scheme programming language\|Scheme]] variant extended to support parallelism
	*[[Occam programming language\|~~Occam~~]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).		*[[Occam programming language\|occam]] – influenced heavily by [[Communicating Sequential Processes]] (CSP).
	**[[Occam-Pi\|~~Occam~~-pi]] – a modern variant of [[Occam programming language\|~~Occam~~]], which incorporates ideas from Milner's [[Pi-Calculus]]		**[[Occam-Pi\|occam-π]] – a modern variant of [[Occam programming language\|occam]], which incorporates ideas from Milner's [[Pi-Calculus\|π-calculus]]
	*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus]]		*[[Pict programming language\|Pict]] – essentially an executable implementation of Milner's [[Pi-Calculus\|π-calculus]]
	*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet		*[[SALSA programming language\|SALSA]] – actor language with token-passing, join, and first-class continuations for distributed computing over the Internet
	*[[SR language\|SR]] – research language		*[[SR language\|SR]] – research language

	Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and ~~Occam~~) have seen industrial use at various times in the last 20 years.		Note that many of these languages are intended more as research languages (e.g., Pict) than as languages for production use. However, several of the examples (such as Erlang, Limbo, and occam) have seen industrial use at various times in the last 20 years.

	Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).		Many other languages provide support for concurrency in the form of libraries (on level roughly comparable with the above list).