Category talk:Tcl: Difference between revisions

From Rosetta Code
Content added Content deleted
No edit summary
Line 6: Line 6:
[[Evens Sum To Even]]
[[Evens Sum To Even]]
: Need the concept of proof in the language for this, and this is really an area that Tcl doesn't address. The formal way to fix it is to write a theorem prover in Tcl, but that'd be a ridiculous amount of work.
: Need the concept of proof in the language for this, and this is really an area that Tcl doesn't address. The formal way to fix it is to write a theorem prover in Tcl, but that'd be a ridiculous amount of work.
[[Memory Allocation]]
: It's not that we can't do this. It's that we don't. One of the good things about Tcl is exactly not having to deal with this sort of thing. It's a whole layer of stuff that we avoid. But if we were to do it, we'd be looking in terms of:
:* Using <code>string repeat</code> or <code>lrepeat</code>
:* Using SWIG or critcl to write a bridge to a C allocator
:* Showing how to do the classic handle-for-structure extension scheme, as documented in JO's book (and updated for the modern age)
[[Parametric Polymorphism]]
[[Parametric Polymorphism]]
: Tcl doesn't have static typing, making this task ridiculously trivial/non-applicable. Note also that the task itself states that it only applies to languages with static typing.
: Tcl doesn't have static typing, making this task ridiculously trivial/non-applicable. Note also that the task itself states that it only applies to languages with static typing.

Revision as of 12:11, 29 May 2009

Tasks Unlikely to get Implemented

This is a short discussion of the tasks that are marked with the omit template. —Dkf 09:14, 21 May 2009 (UTC)

Constrained Genericity

This is a specialization of the Parametric Polymorphism task, so all comments there apply here too.

Evens Sum To Even

Need the concept of proof in the language for this, and this is really an area that Tcl doesn't address. The formal way to fix it is to write a theorem prover in Tcl, but that'd be a ridiculous amount of work.

Memory Allocation

It's not that we can't do this. It's that we don't. One of the good things about Tcl is exactly not having to deal with this sort of thing. It's a whole layer of stuff that we avoid. But if we were to do it, we'd be looking in terms of:
  • Using string repeat or lrepeat
  • Using SWIG or critcl to write a bridge to a C allocator
  • Showing how to do the classic handle-for-structure extension scheme, as documented in JO's book (and updated for the modern age)

Parametric Polymorphism

Tcl doesn't have static typing, making this task ridiculously trivial/non-applicable. Note also that the task itself states that it only applies to languages with static typing.