Recherche

Afficher tous les résultats pour

Accueil

Concept

LLVM

Applied sciences
Génie informatique
Programmation informatique
Programmation informatique

Science formelle
Informatique théorique
Théorie des langages de pro...
Langage de programmation de...

Publications associées (22)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Miniphases: Compilation using Modular and Efficient Tree Transformations

Martin Odersky, Dmytro Petrashko, Ondrej Lhoták

Production compilers commonly perform dozens of transformations on an intermediate representation. Running those transformations in separate passes harms performance. One approach to recover performance is to combine transformations by hand in order to red ...

Assoc Computing Machinery2017

Quoted Staged Rewriting: A Practical Approach to Library-Defined Optimizations

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Staging has proved a successful technique for programmatically removing code abstractions, thereby allowing for faster program execution while retaining a high-level interface for the programmer. Unfortunately, techniques based on staging suffer from a num ...

ACM2017

Function Passing: A Model for Typed, Distributed Functional Programming

Heather Christine Klug, Philipp Haller, Jocelyn Boullier

The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model we call function passing designed to provide a more principled substrate on which to build data-centric distributed systems. A key id ...

Assoc Computing Machinery2016

Automating Ad hoc Data Representation Transformations

Martin Odersky, Vlad Ureche

To maximize run-time performance, programmers often specialize their code by hand, replacing library collections and containers by custom objects in which data is restructured for efficient access. However, changing the data representation is a tedious and ...

Assoc Computing Machinery2015

Towards an innovative temporary event structure based on bioclimatic principles

Emmanuel Rey, Loïc Vivien Fumeaux

Switzerland has adopted the concept of the 2000 Watts society as a long term target, with an intermediate objective for 2050: a reduction of the average energy consumption per person from 6300 to 3500 watts, including a maximum of 2000 watts of non-renewab ...

2014

Optimizing Data Structures in High-Level Programs New Directions for Extensible Compilers based on Staging

Martin Odersky, Tiark Rompf, Nada Amin, Vojin Jovanovic, Manohar Jonnalagedda

High level data structures are a cornerstone of modern programming and at the same time stand in the way of compiler optimizations. In order to reason about user or library-defined data structures, compilers need to be extensible. Common mechanisms to exte ...

Assoc Computing Machinery2013

Scala-Virtualized: Linguistic Reuse for Deep Embeddings

Martin Odersky, Tiark Rompf, Philipp Haller, Nada Amin

Scala-Virtualized extends the Scala language to better support hosting embedded DSLs. Scala is an expressive language that provides a flexible syntax, type-level computation using implicits, and other features that facilitate the development of em- bedded ...

Springer Verlag2013

Boosting Binary Keypoint Descriptors

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

Binary keypoint descriptors provide an efficient alternative to their floating-point competitors as they enable faster processing while requiring less memory. In this paper, we propose a novel framework to learn an extremely compact binary descriptor we ca ...

2013

Lightweight Modular Staging and Embedded Compilers : Abstraction without Regret for High-Level High-Performance Programming

Tiark Rompf

Programs expressed in a high-level programming language need to be translated to a low-level machine dialect for execution. This translation is usually accomplished by a compiler, which is able to translate any legal program to equivalent low-level code. B ...

EPFL2012

Enabling Sophisticated Analysis of x86 Binaries with RevGen

George Candea, Vitaly Chipounov

Current state-of-the-art static analysis tools for binary software operate on ad-hoc intermediate representations (IR) of the machine code. Therefore, even though IRs facilitate program analysis by abstracting away the source language, it is hard to reuse ...

2011

Page 2 sur 3