Stateless and pure - Revision history

Manus at 15:13, 29 June 2011

2011-06-29T15:13:14Z

← Older revision		Revision as of 15:13, 29 June 2011
Line 1:		Line 1:
	[[Category:ECMA]]		[[Category:ECMA]]

	Stateless ~~can be syntactical or~~ semantic~~. Semantic means~~ that ~~the~~ feature does not refer to any state. ~~Syntactical means~~ that ~~we annotate the routine with~~ the ~~equal sign so that this is visible to~~ clients.		Stateless is first a semantic notion, meaning that a stateless feature does not refer to any state. To show that property to the clients, we add a syntactical notation based on the notion of constants in Eiffel, this looks like:

	~~Proposal to have stateless routines to use~~ the ~~equal sign~~ of constants, ~~i.e.~~

	<e>f (a: STRING): SOME_TYPE =		<e>f (a: STRING): SOME_TYPE =

Manus at 15:03, 29 June 2011

2011-06-29T15:03:30Z

← Older revision		Revision as of 15:03, 29 June 2011
Line 1:		Line 1:
	[[Category:ECMA]]		[[Category:ECMA]]

			Stateless can be syntactical or semantic. Semantic means that the feature does not refer to any state. Syntactical means that we annotate the routine with the equal sign so that this is visible to clients.

	Proposal to have stateless routines to use the equal sign of constants, i.e.		Proposal to have stateless routines to use the equal sign of constants, i.e.

Manus at 13:32, 29 June 2011

2011-06-29T13:32:59Z

← Older revision		Revision as of 13:32, 29 June 2011
Line 7:		Line 7:
	...		...
	end</e>		end</e>

			With some validity rules:
			* only unqualified calls to stateless features are permitted.

	With some validity rules for redefinition:		With some validity rules for redefinition:
	* once a routine is stateless its redefinitions have to be stateless.		* once a routine is stateless its redefinitions have to be stateless.
	* a stateful routine can become stateless.		* a stateful routine can become stateless.

Manus at 13:26, 29 June 2011

2011-06-29T13:26:17Z

← Older revision		Revision as of 13:26, 29 June 2011
Line 9:		Line 9:

	With some validity rules for redefinition:		With some validity rules for redefinition:
	- once a routine is stateless its redefinitions have to be stateless.		* once a routine is stateless its redefinitions have to be stateless.
	- a stateful routine can become stateless.		* a stateful routine can become stateless.

Manus at 13:25, 29 June 2011

2011-06-29T13:25:23Z

← Older revision		Revision as of 13:25, 29 June 2011
Line 1:		Line 1:
			[[Category:ECMA]]
	Proposal to have stateless routines to use the equal sign of constants, i.e.		Proposal to have stateless routines to use the equal sign of constants, i.e.

Manus: New page: Proposal to have stateless routines to use the equal sign of constants, i.e. f (a: STRING): SOME_TYPE = do create Result.make (a) ... end With some validit...

2011-06-29T13:25:01Z

New page: Proposal to have stateless routines to use the equal sign of constants, i.e. <e>f (a: STRING): SOME_TYPE = do create Result.make (a) ... end</e> With some validit...

New page

Proposal to have stateless routines to use the equal sign of constants, i.e.

<e>f (a: STRING): SOME_TYPE =
do
create Result.make (a)
...
end</e>

With some validity rules for redefinition:
- once a routine is stateless its redefinitions have to be stateless.
- a stateful routine can become stateless.