Conference
A calculus for predicative programming
Abstract
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are well known from the specification language Z. All elements of a simple sequential programming notation are defined in terms of predicates. Hence programs form a subset of specifications. In particular, sequential composition is defined by ‘demonic composition’, …
Authors
Sekerinski E
Series
Lecture Notes in Computer Science
Volume
669
Pagination
pp. 302-322
Publisher
Springer Nature
Publication Date
1993
DOI
10.1007/3-540-56625-2_20
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743