Skip Navigation

The Computer Journal 1995 38(2):142-151; doi:10.1093/comjnl/38.2.142
© 1995 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gunter, E.
Right arrow Articles by Maharj, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Studying the ML module system in HOL

E. Gunter * and S. Maharj §

1 AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, N.J. 07974, USA elsa{at}research.att.com, 2 LFCS, University of Edinburgh, Edinburgh EH9 3JZ, UK sum{at}dcs.ed.ac.uk

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 encode this as well. Next we relate these two semantics via embeddings and projections and discuss how we use these to prove that evaluation in the proposed system is a conservative extension, in an appropriate sense, of evaluation in the SML Module system.


* AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, N.J. 07974, USA elsa{at}research.att.com

§ LFCS, University of Edinburgh, Edinburgh EH9 3JZ, UK sum{at}dcs.ed.ac.uk


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.