Remark on algorithm 368: Numerical inversion of Laplace transforms

We have introduced a formalism which allows us to explicate certain rather gross properties of language processing systems. As it is, the notation should be useful for designing the outlines of complex programming systems and their implementation, and it should be especially good for documentation. The formalism should also provide a mathematical basis which can be extended to handle more detailed properties of such systems. Some specific inadequacies where it could be extended follow.