Concept

First-class function

Related publications (61)

On Counter-Example Complete Verification for Higher-Order Functions

Viktor Kuncak, Etienne Kneuss, Nicolas Charles Yves Voirol

We present a verification procedure for pure higher-order functional Scala programs with parametric types. We show that our procedure is sound for proofs, as well as sound and complete for counter-examples. The procedure reduces the analysis of higher-orde ...

2015

Reduced basis multiscale finite element methods for elliptic problems

Jan Sickmann Hesthaven

In this paper, we propose reduced basis multiscale finite element methods (RB-MsFEM) for elliptic problems with highly oscillating coefficients. The method is based on multiscale finite element methods with local test functions that encode the oscillatory ...

Society for Industrial and Applied Mathematics2015

Adaptive Query Processing on Raw Data Files

Ioannis Alagiannis

Nowadays, business and scientific applications accumulate data at an increasing pace. This growth of information has already started to outgrow the capabilities of database management systems (DBMS). In a typical DBMS usage scenario, the user should define ...

EPFL2015

Preconditioned Spectral Descent for Deep Learning

Volkan Cevher, Ya-Ping Hsieh, Edo Collins

Deep learning presents notorious computational challenges. These challenges in- clude, but are not limited to, the non-convexity of learning objectives and estimat- ing the quantities needed for optimization algorithms, such as gradients. While we do not a ...

2015

Scaling the Memory Power Wall with DRAM-Aware Data Management

Anastasia Ailamaki, Raja Appuswamy, Matthaios Alexandros Olma

Improving the energy efficiency of database systems has emerged as an important topic of research over the past few years. While significant attention has been paid to optimizing the power consumption of tradition disk-based databases, little attention has ...

ACM2015

Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution

Martin Odersky, Philipp Haller

Functional programming (FP) is regularly touted as the way forward for bringing parallel, concurrent, and distributed programming to the mainstream. The popularity of the rationale behind this viewpoint (immutable data transformed by function application) ...

2014

Code-Pointer Integrity

George Candea, Mathias Josef Payer, Volodymyr Kuznetsov

Systems code is often written in low-level languages like C/C++, which offer many benefits but also delegate memory management to programmers. This invites memory safety bugs that attackers can exploit to divert control flow and compromise the system. Depl ...

2014

What are the Odds? Probabilistic programming in Scala

Tiark Rompf, Nada Amin, Sandro Stucki, Manohar Jonnalagedda

Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...

ACM2013

Termination Analysis in a Higher-Order Functional Context

Nicolas Charles Yves Voirol

We start by describing how higher-order function support can be added to a (first order) functional verification framework. We cover both the higher-order construct management and framework extensions necessary for constraint specification. Next, we outlin ...

2013

Spores, Formally

Philipp Haller

2013

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.