June 20, 2022 Conference paper Open Access

Aubert, Clément; Rubiano, Thomas; Rusch, Neea; Seiller, Thomas

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.7938752</identifier>
  <creators>
    <creator>
      <creatorName>Aubert, Clément</creatorName>
      <givenName>Clément</givenName>
      <familyName>Aubert</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0001-6346-3043</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Rubiano, Thomas</creatorName>
      <givenName>Thomas</givenName>
      <familyName>Rubiano</familyName>
    </creator>
    <creator>
      <creatorName>Rusch, Neea</creatorName>
      <givenName>Neea</givenName>
      <familyName>Rusch</familyName>
    </creator>
    <creator>
      <creatorName>Seiller, Thomas</creatorName>
      <givenName>Thomas</givenName>
      <familyName>Seiller</familyName>
    </creator>
  </creators>
  <titles>
    <title>Realizing Implicit Computational Complexity</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2022</publicationYear>
  <dates>
    <date dateType="Issued">2022-06-20</date>
  </dates>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/7938752</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.7938751</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-nd/4.0/legalcode">Creative Commons Attribution No Derivatives 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variables in three different ways, at different stages of maturation.
The first and third projects bend the original typing discipline to gain finer-grained view on statements independence, to optimize loops by hoisting invariant and by splitting loops "horizontally" to parallelize them more efficiently.
The second project refines and implements the original analysis to obtain a fast, modular static analyzer.
All three projects aims at pushing the original type system, inspired from ICC, to its limits, to assess how ICC can in practice leads to original, sometimes orthogonal, approaches.</description>
  </descriptions>
</resource>