Studying the ML module system in HOL | Zendy

Elsa L. Gunter | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Studying the ML module system in HOL

Author(s) -

Elsa L. Gunter

Publication year - 1995

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/38.2.142

Subject(s) - hol , computer science , semantics (computer science) , encode , programming language , extension (predicate logic) , functor , automated theorem proving , theoretical computer science , mathematics , discrete mathematics , biochemistry , chemistry , gene

In an earlier project of VanInwegen and Gunter, the dynamic semantics of the Core of Standard ML (SML) was encoded in the HOL theorem-prover. We extend this by adding the dynamic Module system. We then develop a possible dynamic semantics for a Module system with higher order functors and projections and discuss how we use these to prove that evaluation in the proposed system is a conservative extension, in an appropiate sense, of evaluation in the SML Module system.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research