Concept

Purely functional programming

Related publications (128)

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.

Verification of Imperative Programs in Scala

Régis William Blanc

Safety-critical software systems can only support a limited number of failures. Extensive testing is good at catching errors, however that will never certify their absence. Formal verification is an alternative to testing that can (automatically) provide a ...

2012

Software Synthesis Procedures

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Automated synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, software synthesis algorithms should behave in a predictable way: they should succ ...

2012

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

Dispersion operators and resistant second-order functional data analysis

Victor Panaretos, David Kraus

Inferences related to the second-order properties of functional data, as expressed by covariance structure, can become unreliable when the data are non-Gaussian or contain unusual observations. In the functional setting, it is often difficult to identify a ...

Oxford University Press2012

Concurrent Tries with Efficient Non-Blocking Snapshots

Martin Odersky, Aleksandar Prokopec

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure spac ...

Assoc Computing Machinery2012

Teaching Enantioselectivity to C-H Bond Functionalizations: Initial Steps of a Rather Long Shot

Nicolai Cramer

The direct functionalization of non-activated C-H bonds, especially in an enantioselective manner, requires metal catalysts equipped with ligands with specifically designed properties. Examples for asymmetric C(sp(2))-H and C(sp(3))-H functionalizations us ...

Swiss Chemical Soc2012

Constraints as Control

Viktor Kuncak, Philippe Paul Henri Suter

We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates con ...

2012

Constraints as Control

Viktor Kuncak, Philippe Paul Henri Suter

ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa2012

Hessian-Based Regularization For 3-D Microscopy Image Restoration

Michaël Unser, Aurélien Bourquard, Stamatios Lefkimmiatis

We investigate a non quadratic regularizer that is based on the Hessian operator for dealing with the restoration of 3-D images in a variational framework. We show that the regularizer under study is a valid extension of the total-variation (TV) functional ...

Ieee2012

Hessian-Based Regularization for 3-D Microscopy Image Restoration

Michaël Unser, Aurélien Bourquard, Stamatios Lefkimmiatis

IEEE2012