Algebraic Composition of Function Tables Journal Articles

abstract

• Abstract.In general, a program is composed of smaller program segments using composition, conditional constructs or loop constructs. We present a theory which enables us to algebraically define and compute the composition of conditional expressions. The conditional expressions are represented using tabular notation. The formal definition of the composition allows us to compute the close form representation of the composition of tabular expressions. The presented approach is based on a many sorted algebra containing information preserving composition. This formal definition of composition is then “lifted” to an extended algebra containing tabular expressions. The presented theory provides very compact algorithms and proofs.

authors

• Von Mohrenschildt, Martin George

status

• published 

publication date

• October 2000

has subject area

• 0802 Computation Theory and Mathematics (FoR)
• 0803 Computer Software (FoR)
• Computation Theory & Mathematics (Science Metrix)

published in

• Formal Aspects of Computing  Journal

keywords

• 46 Information and Computing Sciences
• 4612 Software Engineering
• 4613 Theory Of Computation

Digital Object Identifier (DOI)

• 10.1007/s001650070035

start page

• 41

end page

• 51

volume

• 12

issue

• 1