This HTML5 document contains 31 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
n20https://kar.kent.ac.uk/id/eprint/73526#
wdrshttp://www.w3.org/2007/05/powder-s#
n21http://purl.org/ontology/bibo/status/
dchttp://purl.org/dc/elements/1.1/
n17https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n19https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n6http://eprints.org/ontology/
n22https://kar.kent.ac.uk/id/event/
bibohttp://purl.org/ontology/bibo/
n18https://kar.kent.ac.uk/id/publication/
n5https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n7https://kar.kent.ac.uk/id/document/
n12https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14doi:10.1145/
n9https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n11https://kar.kent.ac.uk/id/person/
n16https://kar.kent.ac.uk/73526/

Statements

Subject Item
n2:73526
rdf:type
bibo:AcademicArticle bibo:Article n6:EPrint n6:ConferenceItemEPrint
rdfs:seeAlso
n16:
owl:sameAs
n14:3314221.3314600
n6:hasAccepted
n7:3174673
n6:hasDocument
n7:3174712 n7:3174709 n7:3174710 n7:3174711 n7:3174673 n7:3174687
dc:hasVersion
n7:3174673
dcterms:title
Characterising Renaming within OCaml’s Module System: Theory and Implementation
wdrs:describedby
n9:export_kar_RDFN3.n3 n19:export_kar_RDFN3.n3
dcterms:date
2019-06-08
dcterms:creator
n11:ext-r.n.s.rowe@kent.ac.uk n11:ext-h.feree@kent.ac.uk n11:ext-s.a.owens@kent.ac.uk n11:ext-s.j.thompson@kent.ac.uk
bibo:status
n21:peerReviewed n21:published
dcterms:publisher
n5:ext-2af1883e4bbfa0356fcedb366171cb38
bibo:abstract
We present an abstract, set-theoretic denotational semantics for a significant subset of OCaml and its module system in order to reason about the correctness of renaming value bindings. Our abstract semantics captures information about the binding structure of programs. Crucially for renaming, it also captures information about the relatedness of different declarations that is induced by the use of various different language constructs (e.g. functors, module types and module constraints). Correct renamings are precisely those that preserve this structure. We demonstrate that our semantics allows us to prove various high-level, intuitive properties of renamings. We also show that it is sound with respect to a (domain-theoretic) denotational model of the operational behaviour of programs. This formal framework has been implemented in a prototype refactoring tool for OCaml that performs renaming
dcterms:isPartOf
n12:repository n18:ext-f8eb84b9da621570d70f551b39429c26
dcterms:subject
n17:QA76
bibo:authorList
n20:authors
bibo:presentedAt
n22:ext-9149a577f9f8308c98ba66cb8a6ef70e