Abstract
The problem of matching an identity to a function is explored. Two methods of improving the speed of the matching process are given. One involves detecting failure as early as possible in the matching process. The other is a notational extension that improves the scaling behaviour of the identity.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have