Concept

Anonymous function

Related publications (63)

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.

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

Making sbt Macro-Aware

Eugene Burmako, Martin Nicolas Duhem

Macros made their first appearance as a fork of the Scala compiler and then as an experimental feature in the version 2.10.0 of Scala. Since macros are normal Scala functions that are executed by the compiler during the compilation of their clients, they c ...

2014

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

A Flow-Insensitive, Modular Effect System for Purity

Martin Odersky, Nada Amin, Lukas Rytz

This article presents a modular, flow-insensitive type-and- effect system for purity with lightweight annotations. It does not enforce a global programming discipline and allows ar- bitrary effects to occur in impure parts of the program. The system is des ...

2013

Multi-round computation of type-threshold functions in collocated Gaussian networks

Michael Christoph Gastpar, Chien-Yi Wang

In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on the computation of type-threshold functions which include t ...

2013

Wireless Multi-hop Networks Beyond Capacity

Patrick Thiran, Adel Aziz

Wireless multi-hop local area networks use in general scheduling schemes that assume the network capacity to be known. Indeed in most of the throughput-optimal algorithms the sources are assumed to send at a rate within the capacity region. However, measur ...

IEEE2013

Querypoint Debugging (Semi-Automated Inspection of Buggy Execution)

Salman Mirghasemi

Debugging is a hard and time-consuming programming task that appears in the most stages of software development and maintenance. Therefore, any improvement in the debugging practice can significantly reduce the time and costs of software production. In thi ...

EPFL2012

Programming with Specifications

Philippe Paul Henri Suter

This thesis explores the use of specifications for the construction of correct programs. We go beyond their standard use as run-time assertions, and present algorithms, techniques and implementations for the tasks of 1) program verification, 2) declarative ...

EPFL2012

Charged cyclometalated iridium(III) complexes that have large electrochemical gap

Michael Graetzel, Mohammad Khaja Nazeeruddin, Rosario Scopelliti

Bis-cyclometalated cationic Ir(III) diimine complexes Ir((CN)-N-Lambda)2((NN)-N-Lambda) with 1-phenylpyrazoles ((CN)-N-Lambda) and 1-(4'-tert-butyl-2'-pyridyl) pyrazole ((NN)-N-Lambda) are white solids that have absorption onset below 425 nm and ele ...

Elsevier2012