Talk:XL (programming language)

This is the talk page for discussing improvements to the XL (programming language) redirect.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Concept programming was nominated for deletion. The discussion was closed on 31 March 2018 with a consensus to merge. Its contents were merged into XL (programming language). The original page is now a redirect to this page. For the contribution history and old versions of the redirected article, please see its history; for its talk page, see here.

This article was nominated for deletion. Please review the prior discussions if you are considering re-nomination:

No consensus, 11 February 2021, see discussion.
No consensus, 28 January 2019, see discussion.
keep, 17 March 2018, see discussion.

Computing: Software Redirect‑class Low‑importance

	This redirect is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Redirect	This redirect does not require a rating on Wikipedia's content assessment scale.
Low	This redirect has been rated as Low-importance on the project's importance scale.
	This redirect is supported by WikiProject Software (assessed as Low-importance).

Untitled

Expression reduction: That's a breaktrough!

Base Case?

// Generic function for the minimum of N item

function Min(X : ordered; ...) return ordered is
  result := Min(...)
  if X < result then
    result := X

Where in this definition is the base case? I.e. what happens when result := Min(...) is evaluated if ... is empty? -- 92.227.78.106 (talk) 08:50, 25 June 2013 (UTC)[reply]

This XL language is unrelated to the XL language referred to in "Relational Growth Grammars - A Parallel Graph Transformation Approach with Applications in Biology and Architecture""

I removed this section that confused the XL language discussed in this article with a completely different subject- relational growth grammars for which different authors coincidentally designed an unrelated language also called "XL".

Relational Growth Grammar While relational growth grammars (RGG) are a theoretical formalism the XL programming language is capable of implementing an RGG-compliant system.^[1]

96.250.126.152 (talk) 13:29, 14 March 2018 (UTC)[reply]

References

^ Kniemeyer, Ole; Barczik, Günter; Hemmerling, Reinhard; Kurth, Winfried. "Relational Growth Grammars - A Parallel Graph Transformation Approach with Applications in Biology and Architecture". Applications of Graph Transformations with Industrial Relevance Third International Symposium, AGTIVE 2007 Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers. Applications of Graph Transformations with Industrial Relevance Third International Symposium, AGTIVE 2007 Kassel, Germany. Springer Berlin Heidelberg. ISBN 9783540890201.

[IDKWTFIATA-1] Kniemeyer, Ole; Barczik, Günter; Hemmerling, Reinhard; Kurth, Winfried. "Relational Growth Grammars - A Parallel Graph Transformation Approach with Applications in Biology and Architecture". Applications of Graph Transformations with Industrial Relevance Third International Symposium, AGTIVE 2007 Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers. Applications of Graph Transformations with Industrial Relevance Third International Symposium, AGTIVE 2007 Kassel, Germany. Springer Berlin Heidelberg. ISBN 9783540890201.

[1]