Predicative programming - Revision history

SchlurcherBot: Bot: http → https

2025-06-14T02:06:22Z

Bot: http → https

← Previous revision		Revision as of 02:06, 14 June 2025
Line 27:		Line 27:
	==References==		==References==
	{{Reflist}}		{{Reflist}}
	* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [~~http~~://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].		* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [https://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].

	== External links ==		== External links ==

	* [~~http~~://www.cs.toronto.edu/~hehner/publist.html Publications] by [[Eric Hehner]].		* [https://www.cs.toronto.edu/~hehner/publist.html Publications] by [[Eric Hehner]].

	[[Category:Formal methods]]		[[Category:Formal methods]]

Naruyoko: Move article message boxes to the top

2024-11-07T02:27:29Z

Move article message boxes to the top

← Previous revision		Revision as of 02:27, 7 November 2024
Line 1:		Line 1:
	{{Short description\|Method of computer program specification}}		{{Short description\|Method of computer program specification}}
	{{Distinguish\|List of conspiracy theories#Predictive programming}}		{{Distinguish\|List of conspiracy theories#Predictive programming}}
		⚫	{{onesource\|date=June 2024}}
			{{inline\|date=June 2024}}

	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.
Line 25:		Line 27:
	==References==		==References==
	{{Reflist}}		{{Reflist}}
⚫	{{onesource~~\|date=June 2024}}{{inline~~\|date=June 2024}}
	* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].		* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].

AnomieBOT: Dating maintenance tags: {{Onesource}} {{Inline}}

2024-06-29T14:31:12Z

Dating maintenance tags: {{Onesource}} {{Inline}}

← Previous revision		Revision as of 14:31, 29 June 2024
Line 25:		Line 25:
	==References==		==References==
	{{Reflist}}		{{Reflist}}
	{{onesource}}{{inline}}		{{onesource\|date=June 2024}}{{inline\|date=June 2024}}
	* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].		* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].

Boleyn: has ref

2024-06-29T14:10:43Z

has ref

← Previous revision		Revision as of 14:10, 29 June 2024
Line 1:		Line 1:
	{{Short description\|Method of computer program specification}}		{{Short description\|Method of computer program specification}}
	{{Distinguish\|List of conspiracy theories#Predictive programming~~}}{{Unreferenced\|date=April 2023~~}}		{{Distinguish\|List of conspiracy theories#Predictive programming}}

	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.

Boleyn: has ref

2024-06-29T14:10:29Z

has ref

← Previous revision		Revision as of 14:10, 29 June 2024
Line 23:		Line 23:
	where <math>ok</math> = (<math>x'</math>=<math>x</math> ∧ <math>t'</math>=<math>t</math>).		where <math>ok</math> = (<math>x'</math>=<math>x</math> ∧ <math>t'</math>=<math>t</math>).

	== ~~Bibliography~~ ==		==References==
			{{Reflist}}
			{{onesource}}{{inline}}
	* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].		* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at [http://www.cs.toronto.edu/~hehner/aPToP a Practical Theory of Programming].

MichaelMaggs: Adding short description: "Method of computer program specification"

2024-04-25T14:54:57Z

Adding short description: "Method of computer program specification"

← Previous revision		Revision as of 14:54, 25 April 2024
Line 1:		Line 1:
			{{Short description\|Method of computer program specification}}
	{{Distinguish\|List of conspiracy theories#Predictive programming}}{{Unreferenced\|date=April 2023}}		{{Distinguish\|List of conspiracy theories#Predictive programming}}{{Unreferenced\|date=April 2023}}

AKA Casey Rollins at 15:30, 14 December 2023

2023-12-14T15:30:42Z

← Previous revision		Revision as of 15:30, 14 December 2023
Line 1:		Line 1:
	{{Unreferenced\|date=April 2023}}		{{Distinguish\|List of conspiracy theories#Predictive programming}}{{Unreferenced\|date=April 2023}}

	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.

Wasianpower: Added unreferenced tag

2023-04-10T03:19:45Z

Added unreferenced tag

← Previous revision		Revision as of 03:19, 10 April 2023
Line 1:		Line 1:
			{{Unreferenced\|date=April 2023}}

	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.

WOSlinker: fix external link

2021-01-08T09:09:41Z

fix external link

← Previous revision		Revision as of 09:09, 8 January 2021
Line 25:		Line 25:
	== External links ==		== External links ==

	* [http://www.cs.toronto.edu/~hehner/publist.html Publications by [[Eric Hehner]].]		* [http://www.cs.toronto.edu/~hehner/publist.html Publications] by [[Eric Hehner]].

	[[Category:Formal methods]]		[[Category:Formal methods]]

109.166.131.158: probabilistic

2019-09-23T23:59:23Z

probabilistic

← Previous revision		Revision as of 23:59, 23 September 2019
Line 1:		Line 1:
	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and probabilistic programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.

	Commands in a [[programming language]] are considered to be a special case of specification—those specifications that are compilable. For example, if the program variables are <math>x</math>, <math>y</math>, and <math>z</math>, the command <math>x</math>:= <math>y</math>+1 is equivalent to the specification (binary expression) <math>x'</math>=<math>y</math>+1 ∧ <math>y'</math>=<math>y</math> ∧ <math>z'</math>=<math>z</math> in which <math>x</math>, <math>y</math>, and <math>z</math> represent the values of the program variables before the assignment, and <math>x'</math>, <math>y'</math>, and <math>z'</math> represent the values of the program variables after the assignment. If the specification is <math>x'</math>><math>y</math>, we easily prove (<math>x</math>:= <math>y</math>+1) ⇒ (<math>x'</math>><math>y</math>), which says that <math>x</math>:= <math>y</math>+1 implies, or refines, or implements <math>x'</math>><math>y</math>.		Commands in a [[programming language]] are considered to be a special case of specification—those specifications that are compilable. For example, if the program variables are <math>x</math>, <math>y</math>, and <math>z</math>, the command <math>x</math>:= <math>y</math>+1 is equivalent to the specification (binary expression) <math>x'</math>=<math>y</math>+1 ∧ <math>y'</math>=<math>y</math> ∧ <math>z'</math>=<math>z</math> in which <math>x</math>, <math>y</math>, and <math>z</math> represent the values of the program variables before the assignment, and <math>x'</math>, <math>y'</math>, and <math>z'</math> represent the values of the program variables after the assignment. If the specification is <math>x'</math>><math>y</math>, we easily prove (<math>x</math>:= <math>y</math>+1) ⇒ (<math>x'</math>><math>y</math>), which says that <math>x</math>:= <math>y</math>+1 implies, or refines, or implements <math>x'</math>><math>y</math>.

← Previous revision		Revision as of 14:10, 29 June 2024
Line 1:		Line 1:
	{{Short description\|Method of computer program specification}}		{{Short description\|Method of computer program specification}}
	{{Distinguish\|List of conspiracy theories#Predictive programming~~}}{{Unreferenced\|date=April 2023~~}}		{{Distinguish\|List of conspiracy theories#Predictive programming}}

	'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.		'''Predicative programming''' is the original name of a formal method for program [[specification language\|specification]] and [[program refinement\|refinement]], more recently called a Practical Theory of Programming, invented by [[Eric Hehner]]. The central idea is that each specification is a binary ([[boolean domain\|boolean]]) expression that is true of acceptable computer behaviors and false of unacceptable behaviors. It follows that refinement is just [[material conditional\|implication]]. This is the simplest formal method, and the most general, applying to sequential, parallel, stand-alone, communicating, terminating, nonterminating, natural-time, real-time, deterministic, and [[probabilistic]] programs, and includes time and space bounds.