Implementation of Parnas' it-ti construct in LISP
Samples, A. Dain
MetadataShow full item record
D.L. Parnas has recently proposed (1) a new programming control structure the it-ti. This construct is a synthesis of several ideas in programming theory including iteration, conditionals, and Dijkstra's guards (2) It has been implemented in a LISP interpreter (8) as a more structured replacement for the traditional prog construct. Several programming examples are given that compare the use of the it-ti with the more conventional programming constructs. These examples will also show that the it-ti fails to satisfy several criteria for programming constructs including manageability and visibility. An appendix to this report contains an extension of Dijkstra's concept of the 'weakest precondition' to the it-ti. (Author)
NPS Report NumberNPS52-82-005
Showing items related by title, author, creator and subject.
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1981 -06); NPS-52-81-008A new method of programming, called relational programming, is introduced. This is a style of programming in which entire relations are manipulated rather than individual data. This is analogous to functional programming, ...
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1981-09); NPS-52-81-013This report describes the concept of programming in a relational calculus. This is a style of programming in which entire relations are manipulated rather than individual data, and in which the program itself is represented ...
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1986-11); NPS52-86-023Relational programming is a style of programming in which entire relations are manipulated as data and in which programs are also considered relations. Extensive use is made of higher-order, finite and infinite relations ...