Talk:Procedural programming: Difference between revisions

Revision as of 13:10, 22 January 2010

Revision as of 13:26, 22 January 2010

Line 1:

<math>Insert formula here</math>{{WikiProject Computing|class=Start|importance=}}

{{compsci|class=start|importance=mid}}

== "Procedural" v. "Imperative" (merge?) ==

Line 42:

:If you consider "Lisp" as a Platonic ideal, you can make it have whatever properties you like. But real Lisp allows side effects and Lisp programmers routinely make use of them. Therefore the mathematical functions in a typical Lisp program do not line up with the language's functions. [[User:Gazpacho|Gazpacho]] 05:38, 27 October 2005 (UTC)

[[File:Example.jpg]]vbvb wdfwdf wfw fw fwdf efew fewf ewfw e

:I think the previous poster meant to say [[Lambda Calculus]], not pure lisp, which I am not aware of actually existing. However, if we limit discussion on this page to languages that are ''only'' declarative, then we are looking at a very small set, indeed (lambda calculus,...). More interesting, I think, are the languages which are ''practically'' declarative (which includes the lisp variants, etc.).

Line 73:

[[With OOP:]]

You must create a class with the unique function, the instance the object of this class, then instantiatecall this object. Next, you must return the result, then must destroy the object and finish the program.

the object of this class, then call this object. Next, you must return the result, then must destroy the object and finish the program.

The resource spend and speed are clear, also you can see a tendency.