This HTML5 document contains 32 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/
n8https://kar.kent.ac.uk/89178/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
n20http://purl.org/ontology/bibo/status/
dchttp://purl.org/dc/elements/1.1/
n16https://kar.kent.ac.uk/id/eprint/89178#
n10https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n12https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n4http://eprints.org/ontology/
n15https://kar.kent.ac.uk/id/event/
bibohttp://purl.org/ontology/bibo/
n17https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n5https://kar.kent.ac.uk/id/document/
n21https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19doi:10.1145/
n14https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n9https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:89178
rdf:type
n4:ConferenceItemEPrint bibo:AcademicArticle n4:EPrint bibo:Article
rdfs:seeAlso
n8:
owl:sameAs
n19:3464972.3472395
n4:hasAccepted
n5:3243099
n4:hasDocument
n5:3243145 n5:3243146 n5:3243147 n5:3243144 n5:3243107 n5:3243099
dc:hasVersion
n5:3243099
dcterms:title
Naïve Transient Cast Insertion Isn’t (That) Bad
wdrs:describedby
n12:export_kar_RDFN3.n3 n14:export_kar_RDFN3.n3
dcterms:date
2021-07
dcterms:creator
n9:ext-610f6274736b3c3839be4a0f190b6f5a n9:ext-2b937dcc380682d06741677ae2a4f467 n9:ext-s.marr@kent.ac.uk n9:ext-7fe42064d1abda6f0e0bba869bbf54ff n9:ext-553a01a8171c3962d1e6d5ece1f5cfdb n9:ext-092a4b43fce92924f99ecc685ab11722
bibo:status
n20:peerReviewed n20:published
dcterms:publisher
n17:ext-2af1883e4bbfa0356fcedb366171cb38
bibo:abstract
Transient gradual type systems often depend on type-based cast insertion to achieve good performance: casts are inserted whenever the static checker detects that a dynamically-typed value may flow into a statically-typed context. Transient gradually typed programs are then often executed using just-in-time compilation, and contemporary just-in-time compilers are very good at removing redundant computations. In this paper we present work-in-progress to measure the ability of just-in-time compilers to remove redundant type checks. We investigate worst-case performance and so take a na'ive approach, annotating every subexpression to insert every plausible dynamic cast. Our results indicate that the Moth VM still manages to eliminate much of the overhead, by relying on the state-of-the-art SOMns substrate and Graal just-in-time compiler. We hope these results will help language implementers evaluate the tradeoffs between dynamic optimisations (which can improve the performance of both statically and dynamically typed programs) and static optimisations (which improve only statically typed code).
dcterms:isPartOf
n21:repository
dcterms:subject
n10:QA
bibo:authorList
n16:authors
bibo:presentedAt
n15:ext-9d90b5d68dfe4a687b8ab8ef544e9921