
	Where results make sense

Topic: Imperative programming

Related Topics

Functional programming

Programming paradigm

Procedural programming

Declarative programming

Functional programming languages

Structured programming

Reflective programming

Lazy evaluation

Literate programming

Clean programming language

Miranda programming language

Eager evaluation

Software componentry

Extreme Programming

Haskell programming language

	Imperative programming - Wikipedia, the free encyclopedia
		In computer science, imperative programming, as opposed to declarative programming, is a programming paradigm that describes computation in terms of a program state and statements that change the program state.
		Imperative programming languages stand in contrast to other types of languages, such as functional and logical programming languages.
		High-level imperative languages, in addition, permit the evaluation of complex expressions, which may consist of a combination of arithmetic operations and function evaluations, and the assignment of the resulting value to memory.
	en.wikipedia.org /wiki/Imperative_programming (846 words)

	Imperative Programming
		Imperative programming is characterized by programming with a state and commands which modify the state.
		Imperative programming languages are characterized by sequences of bindings.
		Programs are sequences of bindings (state changes) in which a name may be bound an object at one point in the program and later bound to a different object.
	cs.wwc.edu /~aabyan/PLBook/book/node145.html (327 words)

	The Imperative Programming Paradigm
		Imperative programs are characterized by sequences of bindings (state changes) in which a name may be bound to a value at one point in the program and later bound to a different value.
		Most descriptions of imperative programming languages are tied to hardware and implementation considerations where a name is bound to an address, a variable to a storage cell, and a value to a bit pattern.
		Imperative programming languages with their emphasis on the sequential evaluation of commands often fail to provide a similar sequentiality to the evaluation of expressions.
	burks.brighton.ac.uk /burks/pcinfo/progdocs/plbook/imperati.htm (5222 words)

	Computer Aids for VLSI Design
		Imperative programs are the kind that most programmers know best: algorithms that execute sequentially from one statement to the next.
		Imperative languages are used for three classes of activity: database creation, database reformatting, and design-system control.
		To improve this ad hoc programming interface, macro packages are often written to provide a third level of command interface that sits on top of, and replaces, the original commands.
	www.rulabinsky.com /cavd/text/chap08-2.html (1751 words)

	LISP Tutorial Lecture 4: Imperative Programming
		Programming this way has the benefit of referential transparency, which means that an experession has the same value and the same behavior, no matter where it is located, and how many times it is invoked.
		This style of programming, in which side effect is not only permissible but is also the primary means by which we program, is called imperative programming.
		Imperative programming is made possible by the notion of program state.
	www.cs.sfu.ca /CC/310/pwfong/Lisp/4/tutorial4.html (1783 words)

	Advanced Imperative programming, CS 2SC3, 2005/06, Term 1 [Intro] (Site not responding. Last check: 2007-10-19)
		imperative programming, as opposed to declarative programming, is a programming paradigm that describes computation in terms of a program state and statements that change the program state.
		recipes, process checklists, directions, are familiar concepts that are similar in style to imperative programming) each step is an instruction, and the physical world holds the state.
		In the late 1980s and 1990s, the notable imperative languages drawing on object-oriented concepts were Perl, released by Larry Wall in 1987; Python, released by Guido van Rossum in 1990; and
	www.cas.mcmaster.ca /~cs2sc3/slides/intro.htm (729 words)

	MyXaml Wiki - Declarative Vs Imperative Programming
		Even if they aren't correct, understanding the differences between declarative and imperative programming is an educational experience because it gives you a different way of looking at how you program.
		Imperative programming is what we pretty much do every day, whether it's in C, C++, Java, C#, VB, etc. It means, writing instructions that control objects.
		When taken to its logical conclusion, large programs end up with a lot of entanglement between the imperative parts and the declarative parts.
	www.myxaml.com /wiki/ow.asp?DeclarativeVsImperativeProgramming (962 words)

	Wadler: Monads
		The use of monads to structure functional programs is described.
		Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.
		This paper shows how list comprehensions may be generalised to an arbitrary monad, and how the resulting programming feature can concisely express in a pure functional language some programs that manipulate state, handle exceptions, parse text, or invoke continuations.
	homepages.inf.ed.ac.uk /wadler/topics/monads.html (746 words)

	Kaleidoscope: A Constraint Imperative Programming Language - Lopez, Freeman-Benson, Borning (ResearchIndex) (Site not responding. Last check: 2007-10-19)
		Discusses design and implementation issues of combining the constraint and imperative programming paradigms.
		Abstract: The Constraint Imperative Programming (CIP) family of languages integrates constraints and imperative, object-oriented programming.
		In addition to combining the useful features of both paradigms, there are synergistic effects of this integration, such as the ability to define constraints over user-defined domains.
	citeseer.ist.psu.edu /lopez93kaleidoscope.html (585 words)

	Search and Imperative Programming - Apt, Schaerf (ResearchIndex) (Site not responding. Last check: 2007-10-19)
		Abstract: We augment the expressive power of imperative programming in order to make it a more attractive vehicle for problems that involve search.
		The proposed additions are limited yet powerful and are inspired by the logic programming paradigm.
		We illustrate their use by presenting solutions to a number of classical problems, including the straight search problem, the knapsack problem, and the 8 queens problem.
	citeseer.ist.psu.edu /298475.html (274 words)

Try your search on: Qwika (all wikis)