Work

Semantics and axiomatics of a simple recursive language.

Year: 1974
Type: conference-paper
Abstract: In this paper, we provide a simple recursive programming language with a semantics and a formalproof System, along the lines of [5J, [17] and [23]. We show that the semantics used is the "best" possibleif one admits the validity of Algol's copy rule, and that the proof System is complété with respect to thesemantics. The définitions and methods used are meant to provide a basis for a broader theory of programschémas, which models parallel as'well as sequential programs.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W1998618679
FWCI: 3.772
Cites: 15
Cited by: 14
Related to: 10