StanfordSlides-29.html

5 Summary

The input/output grammar was defined and shown to have some useful properties; invertible, directly executable, extendible, compilable. How far it can go is an open question.

Reference

http://www.mathworks.com/matlabcentral/fileexchange/20149

Signature

Presented to the Computer Science Colloquium, Stanford, March 4, 2009

Bill McKeeman, MathWorks Fellow

PREV