This HTML5 document contains 30 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/
n18https://kar.kent.ac.uk/74327/
wdrshttp://www.w3.org/2007/05/powder-s#
n15http://purl.org/ontology/bibo/status/
dchttp://purl.org/dc/elements/1.1/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n14https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n11http://eprints.org/ontology/
n20doi:10.4230/
n13https://kar.kent.ac.uk/id/event/
bibohttp://purl.org/ontology/bibo/
n12https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n8https://kar.kent.ac.uk/id/eprint/74327#
n10https://kar.kent.ac.uk/id/document/
n16https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n4https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n6https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:74327
rdf:type
bibo:Article n11:EPrint bibo:AcademicArticle n11:ConferenceItemEPrint
rdfs:seeAlso
n18:
owl:sameAs
n20:LIPIcs.ECOOP.2019.5
n11:hasAccepted
n10:3181780
n11:hasDocument
n10:3181780 n10:3181782 n10:3181783 n10:3181784 n10:3181785 n10:3181786
dc:hasVersion
n10:3181780
dcterms:title
Transient Typechecks are (Almost) Free
wdrs:describedby
n4:export_kar_RDFN3.n3 n14:export_kar_RDFN3.n3
dcterms:date
2019-04-01
dcterms:creator
n6:ext-mwh@ecs.vuw.ac.nz n6:ext-kjx@ecs.vuw.ac.nz n6:ext-s.marr@kent.ac.uk n6:ext-rykardo.r@gmail.com
bibo:status
n15:peerReviewed n15:published
dcterms:publisher
n12:ext-fb716d0e4677e460329957b7f78b51e8
bibo:abstract
Transient gradual typing imposes run-time type tests that typically cause a linear slowdown in programs’ performance. This performance impact discourages the use of type annotations because adding types to a program makes the program slower. A virtual machine can employ standard justin-time optimizations to reduce the overhead of transient checks to near zero. These optimizations can give gradually-typed languages performance comparable to state-of-the-art dynamic languages, so programmers can add types to their code without affecting their programs’ performance.
dcterms:isPartOf
n16:repository
bibo:authorList
n8:authors
bibo:presentedAt
n13:ext-18844ab521a2ef39bf6dc5cdb3faef2b
bibo:volume
134