Are there any valid ways of eliminating/reducing state?
For definitions and examples of “state”, see: http://en.wikipedia.org/wiki/Program_state , http://en.wikipedia.org/wiki/Finite_state_machine , http://en.wikipedia.org/wiki/State_diagram
Clojure state and persistence
I’m learning Clojure to see if it’s something I can leverage at my current job, and more importantly, how I can convince my bosses that Clojure has a ‘killer feature’ over java that makes it worth the investment1.
Is it possible to implement a completely-stateless multiplayer game?
I’m facing a challenge understanding how to program a web version of a card game that is completely stateless.
I don’t understand the definition of side effects [duplicate]
Possible Duplicate:
What is a “side effect?”
How does a variable introduce state?
I was reading the “C++ Coding Standards” and this line was there:
Validation and Error Generation when using the Data Mapper Pattern
I am working on saving state of an object to a database using the data mapper pattern, but I am looking for suggestions/guidance on the validation and error message generation step (step 4 below). Here are the general steps as I see them for doing this:
On Developing Web Services with Global State
I’m new to web programming. I’m more experienced and comfortable with client-side code. Recently, I’ve been dabbling in web programming through Python’s Google App Engine. I ran into some difficulty while trying to write some simple apps for the purposes of learning, mainly involving how to maintain some kind of consistent universally-accessible state for the application.
script engine with no global environment (java)
I am curious about how global variables are handled by script engines. I am looking for a script engine that does not preserve the state of global variables upon invocation. Are there such engines out there? We are looking for a scripting language we can use under the script engine API for Java.
What is the preferred way of communicating between applications on the same system?
I’m designing a system that is built on several small applications written in python, some of these will be services and others will be programs that only run during special situations. What I need to achieve is to let the server communicate to a service when a certain event occurs with some small amount of data. So that the service knows about the new situation and can take the appropriate action, sometimes immediately and sometimes in the future.
In Scheme, what is formally a program’s state?
I think i’ve understood more or less what a parsed Scheme program looks like (a binary tree with atomic values on the leaves, if i have understood correctly). Can anybody please define to me, or give a reference, what a state (or a computation) of a Scheme program is? Is it just the current binding plus a position, or a stack of positions, on the syntax tree? (In such a case, i would appreciate a reference for a formal definition of Scheme binding as well :).)