Concept

Expression (computer science)

Related publications (15)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The Simple Essence of Algebraic Subtyping: Principal Type Inference with Subtyping Made Easy

Lionel Emile Vincent Parreaux

MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact principal types, an exciting new development. However, its specification in terms of biunification is difficult to understand, relying on the new concepts of bi ...

2020

Bits through Time

Elie Najm

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

EPFL2019

Towards a Solution to the Red Wedding Problem

Edge computing promises lower latency interactions for clients operating at the edge by shifting computation away from Data Centers to Points of Presence which are more abundant and located geographically closer to end users. However, most commercially ava ...

2018

Cyme: A Library Maximizing SIMD Computation on User-Defined Containers

Felix Schürmann, Timothée Ewart

This paper presents Cyme, a C++ library aiming at abstracting the usage of SIMD instructions while maximizing the usage of the underlying hardware. Unlike similar efforts such as Boost.simd or VC, Cyme provides generic high level containers to the users wh ...

Springer International Publishing2014

Symbolic Resource Bound Inference

Viktor Kuncak, Ravichandhran Kandhadai Madhavan

We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the boun ...

2014

On Repairing Ill-Typed Expressions

Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

When developing code, a programmer typically knows the approximate structure of the desired expression. However, often the first attempt at writing it down results in an ill-typed code fragment. We propose an approach that automatically repairs code expres ...

2013

PEN recsys: a Personalized News Recommender Systems Framework (DEMO)

Boi Faltings, Florent Frédéric Garcin

We present the Personalized News (PEN) recommender systems framework, (Note that this paper is an extended abstract of Garcin2013b), currently in use by a newspaper website to evaluate various algorithms for news recommendations. We briefly describe its sy ...

2013

PEN recsys: a Personalized News Recommender Systems Framework

Boi Faltings, Florent Frédéric Garcin

We present the Personalized News (PEN) recommender systems framework, currently in use by a newspaper website to evaluate various algorithms for news recommendations. We briefly describe its system architecture and related components. We show how a researc ...

2013

Fast and accurate computation of hyper-singular integrals in Galerkin surface integral equation formulations via the direct evaluation method

Juan Ramon Mosig

Hypersingular 4-D integrals, arising in the Galerkin discretization of surface integral equation formulations, are computed by means of the direct evaluation method. The proposed scheme extends the basic idea of the singularity cancellation methods, usuall ...

Institute of Electrical and Electronics Engineers2011

On Static Analysis for Expressive Pattern Matching

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

Pattern matching is a widespread programming language construct that enables definitions of values by cases, generalizing if-then-else and case statements. The cases in a pattern matching expression should be exhaustive: when the value does not match any o ...

2008