Talk:Reification (computer science)

From Wikipedia, the free encyclopedia

	This article is within the scope of Computing WikiProject, an attempt to build a comprehensive and detailed guide to computers and computing. If you would like to participate, you can edit the article attached to this page, or visit the project page, where you can join the project and/or contribute to the discussion.
Start	This article has been rated as Start-Class on the quality scale
Mid	This article has been rated as mid-importance on the importance scale

[edit] Citations

Hello. There is a reference in the article which is good. I added one "citations missing" tag because I couldn't see the source. I have no knowledge of reification really. You are most welcome from my point of view to remove or change the tag. Hope this helps. -Susanlesch 21:05, 11 November 2007 (UTC)

[edit] Lack of cohesion (and of clear meaning)

This unparagraphed article is something extraordinarily difficult to read (for me).

Look at snippets as: "When objects in Smalltalk are viewed as pointers to structs carrying pointers to functions the analogy is clear. There has been renewed interest in the explicit use of C for the implementation of Smalltalk primitives. C is also the language used to implement 3rd-generation Smalltalk in the language Io."

Even reading what's before, understanding what "analogy" the author is talking about is for me impossible. And anyway, I see little coherence in what is written.

I agree it's very hard to read. It's Interesting, but it could have less opinion and be rewritten. LegendLength (talk) 04:19, 22 February 2008 (UTC)

[edit] Forth

Why isn’t Forth mentioned? It’s the apotheosis of reification, giving the programmer access to every internal structure, including its return stack, dictionary and more. Roman V. Odaisky (talk) 12:11, 31 December 2007 (UTC)