One of the classical ways of learning programming is to divide programming tasks into large groups, so-called programming theorems, and then to trace the specific tasks back to the programming theorems. Each teaching method introduces a different amount of programming theorems into the learning pro-cess, occasionally even combining them. In this article we will show that the basic and complex pro-gramming theorems have the same origin; consequently, it would be enough to present one theorem and trace everything back to it. At the end of the article, then, we will explain the practical use of still introduc-ing more theorems
A large part of the effort in formal program developments is expended on repeating the same derivati...
This exploratory study reports on characteristics of proof production and proof writing observed in ...
Problem statements often resort to superlatives such as in e.g. “… the smallest such number”, “… the...
One of the classical ways of learning programming is to divide programming tasks into large groups, ...
International audienceIn this chapter, we propose some future directions of work, potentially benefi...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
International audienceThe topics of structural proof theory and logic programming have influenced ea...
We show how the first steps of algorithmic thinking and programming can be trained separately. The l...
Programm i n g is a very difficult task. In order to improve our und e r standing we should try to s...
this paper is to investigate the impact on the design of a programming language of tight integration...
What is a proof for? What is the characteristic use of a proof as a computation, as opposed to its u...
Despite the insight of some of the pioneers (Turing, von Neumann, Curry, Böhm), programming the earl...
AbstractThe realization of inference rules as the primitive operations of a type “theorem” in a type...
AbstractProblem statements often resort to superlatives such as in e.g. “… the smallest such number”...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
A large part of the effort in formal program developments is expended on repeating the same derivati...
This exploratory study reports on characteristics of proof production and proof writing observed in ...
Problem statements often resort to superlatives such as in e.g. “… the smallest such number”, “… the...
One of the classical ways of learning programming is to divide programming tasks into large groups, ...
International audienceIn this chapter, we propose some future directions of work, potentially benefi...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
International audienceThe topics of structural proof theory and logic programming have influenced ea...
We show how the first steps of algorithmic thinking and programming can be trained separately. The l...
Programm i n g is a very difficult task. In order to improve our und e r standing we should try to s...
this paper is to investigate the impact on the design of a programming language of tight integration...
What is a proof for? What is the characteristic use of a proof as a computation, as opposed to its u...
Despite the insight of some of the pioneers (Turing, von Neumann, Curry, Böhm), programming the earl...
AbstractThe realization of inference rules as the primitive operations of a type “theorem” in a type...
AbstractProblem statements often resort to superlatives such as in e.g. “… the smallest such number”...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
A large part of the effort in formal program developments is expended on repeating the same derivati...
This exploratory study reports on characteristics of proof production and proof writing observed in ...
Problem statements often resort to superlatives such as in e.g. “… the smallest such number”, “… the...