Talk:Concurrent constraint logic programming - Revision history

Qwerfjkl (bot): Implementing WP:PIQA (Task 26)

2024-01-27T21:34:05Z

← Previous revision		Revision as of 21:34, 27 January 2024
Line 1:		Line 1:
	{{WikiProject ~~Computer~~ ~~Science~~\|class=~~start~~\|~~importance=low}}~~		{{WikiProject banner shell\|class=Start\|
			{{WikiProject Computer science\|importance=low}}
			}}
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

Felix QW: Assessment

2023-08-04T18:53:09Z

Assessment

← Previous revision		Revision as of 18:53, 4 August 2023
Line 1:		Line 1:
	{{WikiProject ~~Computing~~}}		{{WikiProject Computer Science\|class=start\|importance=low}}
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

86.186.119.166: Without examples, the article gives the impression that concurrent constraint logic programming is useless.

2016-07-27T15:24:44Z

Without examples, the article gives the impression that concurrent constraint logic programming is useless.

← Previous revision		Revision as of 15:24, 27 July 2016
Line 14:		Line 14:

	The article is actually about concurrent logic programming, with only a small part concerned with concurrent constraint logic programming. It would make more sense to merge it with the new [[Concurrent logic programming]] article, with a subsection on concurrent constraint logic programming. [[User:Logperson\|Logperson]] ([[User talk:Logperson\|talk]]) 20:17, 14 May 2014 (UTC)		The article is actually about concurrent logic programming, with only a small part concerned with concurrent constraint logic programming. It would make more sense to merge it with the new [[Concurrent logic programming]] article, with a subsection on concurrent constraint logic programming. [[User:Logperson\|Logperson]] ([[User talk:Logperson\|talk]]) 20:17, 14 May 2014 (UTC)
			== This article has no examples ==

			Without examples, the article gives the impression that concurrent constraint logic programming is useless. [[Special:Contributions/86.186.119.166\|86.186.119.166]] ([[User talk:86.186.119.166\|talk]]) 15:23, 27 July 2016 (UTC)

Christian75: Assessment: +Computing (assisted)

2014-10-12T12:04:07Z

Assessment: +Computing (assisted)

← Previous revision		Revision as of 12:04, 12 October 2014
Line 1:		Line 1:
			{{WikiProject Computing}}
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

Logperson: Suggestion to merger with concurrent logic programming articel/

2014-05-14T20:17:08Z

Suggestion to merger with concurrent logic programming articel/

← Previous revision		Revision as of 20:17, 14 May 2014
Line 9:		Line 9:
	*Saraswat, V. A., Rinard M. and P. Panangaden. ''Semantic Foundation of Concurrent Constraint Programming''. In Proceedings of 18th ACM Symposium on Principles of Programming Languages, 1991		*Saraswat, V. A., Rinard M. and P. Panangaden. ''Semantic Foundation of Concurrent Constraint Programming''. In Proceedings of 18th ACM Symposium on Principles of Programming Languages, 1991
	--[[User:PatricH Winston]] 06:16, 2 Feb 2010 (UTC)		--[[User:PatricH Winston]] 06:16, 2 Feb 2010 (UTC)

			== This article has the wrong title ==

			The article is actually about concurrent logic programming, with only a small part concerned with concurrent constraint logic programming. It would make more sense to merge it with the new [[Concurrent logic programming]] article, with a subsection on concurrent constraint logic programming. [[User:Logperson\|Logperson]] ([[User talk:Logperson\|talk]]) 20:17, 14 May 2014 (UTC)

PatricH Winston at 06:17, 2 February 2010

2010-02-02T06:17:46Z

← Previous revision		Revision as of 06:17, 2 February 2010
Line 4:		Line 4:

	:This seems unnecessarily restrictive. For instance, Oz does recursively try all clauses in the worst case, and Oz is clearly a concurrent constraint logic language. --[[User:David-Sarah Hopwood\|David-Sarah Hopwood ⚥]] ([[User talk:David-Sarah Hopwood\|talk]]) 19:27, 3 December 2009 (UTC)		:This seems unnecessarily restrictive. For instance, Oz does recursively try all clauses in the worst case, and Oz is clearly a concurrent constraint logic language. --[[User:David-Sarah Hopwood\|David-Sarah Hopwood ⚥]] ([[User talk:David-Sarah Hopwood\|talk]]) 19:27, 3 December 2009 (UTC)

			This title should be "Concurrent constraint programming", like
			*Saraswat, V. A., and Rinard M. ''Concurrent Constraint Programming''. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, January 1990
			*Saraswat, V. A., Rinard M. and P. Panangaden. ''Semantic Foundation of Concurrent Constraint Programming''. In Proceedings of 18th ACM Symposium on Principles of Programming Languages, 1991
			--[[User:PatricH Winston]] 06:16, 2 Feb 2010 (UTC)

Daira Emma Hopwood: description is too restrictive

2009-12-03T19:27:07Z

description is too restrictive

← Previous revision		Revision as of 19:27, 3 December 2009
Line 1:		Line 1:
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

			''Semantically, concurrent constraint logic programming differs from its non-concurrent versions because a goal evaluation is intended to realize a concurrent process rather than finding a solution to a problem. Most notably, this difference affects how the interpreter behaves when more than one clause is applicable: non-concurrent constraint logic programming recursively tries all clauses; concurrent constraint logic programming chooses only one. This is the most evident effect of an intended directionality of the interpreter, which never revise a choice it has previously taken.''

			:This seems unnecessarily restrictive. For instance, Oz does recursively try all clauses in the worst case, and Oz is clearly a concurrent constraint logic language. --[[User:David-Sarah Hopwood\|David-Sarah Hopwood ⚥]] ([[User talk:David-Sarah Hopwood\|talk]]) 19:27, 3 December 2009 (UTC)

Daira Emma Hopwood at 19:35, 29 August 2007

2007-08-29T19:35:09Z

← Previous revision		Revision as of 19:35, 29 August 2007
Line 1:		Line 1:
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. [[Flat Concurrent Prolog]]), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

Daira Emma Hopwood at 19:34, 29 August 2007

2007-08-29T19:34:47Z

← Previous revision		Revision as of 19:34, 29 August 2007
Line 1:		Line 1:
	There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming language\|Oz]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)		There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming language\|Oz]] and [[Alice programming language\|Alice]]). --[[User:DavidHopwood\|DavidHopwood]] 19:33, 29 August 2007 (UTC)

Daira Emma Hopwood: ←Created page with 'There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming la...'

2007-08-29T19:33:22Z

←Created page with 'There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming la...'

New page

There should be some discussion of concrete languages supporting this paradigm, both historical (e.g. Flat Concurrent Prolog), and current (e.g. [[Oz programming language|Oz]]). --[[User:DavidHopwood|DavidHopwood]] 19:33, 29 August 2007 (UTC)