1991Academic Press Professional, Inc. eBooksRequires access

An introduction to programming with specifications: a mathematical approach

Roman Rudziński, S. Sokołowski, Ryszard Kubiak

Open publisher page 2 citations

Abstract

Basic mathematical vocabulary on definitions and specifications conditional expressions local definitions recursive function definitions designing recursive definitions more complex recursion high-order data - sequences our main tool - induction proving facts about recursively defined functions tail recursion iterative algorithms from recursion to iteration and back partial and total correctness how to design iterative algorithms computer programming solutions of exercises.

About this research paper

What this paper is about

Basic mathematical vocabulary on definitions and specifications conditional expressions local definitions recursive function definitions designing recursive definitions more complex recursion high-order data - sequences our main tool - induction proving facts about recursively defined functions tail recursion iterative algorithms from recursion to iteration and back partial and total correctness how to design iterative algorithms computer programming solutions of exercises.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Basic mathematical vocabulary on definitions and specifications conditional expressions local definitions recursive function definitions designing recursive definitions more complex recursion high-order data - sequences our main tool - induction proving facts about recursively defined functions tail recursion iterative algorithms from recursion to iteration and back partial and total correctness how to design iterative algorithms computer programming solutions of exercises.

Key concepts: Recursion (computer science), Mutual recursion, Double recursion, Correctness, Computer science, Recursive functions, Theoretical computer science, Mathematical induction

Related papers

Back to paper searchBrowse research topicsOriginal source
An introduction to programming with specifications: a mathematical approach — Research Paper | ScholarLens