Bernhard Reus. Program Verification in Synthetic Doamin Theory. PhD thesis, Ludwigs Maximilians Universitat Munchen, 1995. WWW: ftp://ftp.informatik. uni-muenchen.de/pub/local/pst/papers/reus/sdt/. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Isabelle/HOL as a Platform for Partiality - Olaf Müller, Konrad Slind (Correct)
....example shows that (some) issues resolvable with total functions can be more easily solved in domain theory. For mainstream mathematics in the same (although much more highpowered) vein see [Eda95] In fact, domain models underly recent proposals for formalizations of constructive mathematics [Reu95] Computer Science shows that there are many flavours of partiality. For example: ffl total functions (zero partiality) ffl intended infinite loops (reactive systems, e.g. our finite and infinite sequences) ffl unintended infinite loops (programmer mistake) ffl error states in programs ffl ....
Bernhard Reus. Program Verification in Synthetic Doamin Theory. PhD thesis, Ludwigs Maximilians Universitat Munchen, 1995. WWW: ftp://ftp.informatik. uni-muenchen.de/pub/local/pst/papers/reus/sdt/.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC