M. VanInwegen and E. Gunter. HOL-ML. Higher Order Logic Theorem Proving and its Applications. Springer LNCS 780 (1994). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The definition of Extended ML: a gentle introduction - Kahrs, Sannella, Tarlecki (1995) (16 citations) (Correct)
....itself is given a formal meaning as well) The size and complexity of the semantics is such that fully formal use of it, e.g. to prove correctness of an optimizing transformation, would be quite a difficult task. An encouraging start in this direction, using the HOL theorem prover, is described in [VG94], MG94] The idea of building a fully fledged specification and formal development framework around a real programming language seems to be novel to EML. Somewhat related is work on the Anna language for annotating Ada programs with assertions concerning their intended behaviour [LHKO87] but ....
M. VanInwegen and E. Gunter. HOL-ML. Higher Order Logic Theorem Proving and its Applications. Springer LNCS 780 (1994).
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