In computations over many-sorted algebras, one typically encounters error cases,
caused by attempting to evaluate an operation outside its domain (e.g. division by
the integer 0; taking the square root of a negative integer; popping an empty stack).
We present a method for systematically dealing with such error cases, namely the
construction of an "error algebra" based on the original algebra. As an application
of this method, we show that it provides a good semantics for (possibly improper)
function tables. / Thesis / Master of Science (MSc)
Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/21255 |
Date | 11 1900 |
Creators | Lei, Wei |
Contributors | Zucker, Jeffery, Computing and Software |
Source Sets | McMaster University |
Language | English |
Detected Language | English |
Page generated in 0.0134 seconds