Concept

F Sharp (programming language)

Related publications (111)

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.

On Interactive Synthesis of Code Snippets

Viktor Kuncak, Tihomir Gvero, Ruzica Piskac

We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. Our approach takes into account polymorphic type constraints as well as code behavior. We have found our system to be useful for synth ...

2011

Toward Interprocedural Pointer and Effect Analysis for Scala

Etienne Kneuss

Static program analysis techniques working on object-oriented languages require precise knowledge of the aliasing relation between variables. This knowledge is important to, among other things, understand the read and write effects of method calls on objec ...

2011

Goto Statement Considered Harmful – A Paper Review

In 1968 Edsger Dijkstra wrote a letter to the editor of Communications of the ACM (CACM) stating his opinion about using the goto statement in programs. This letter would serve to begin a hot-headed debate within the programming community. This topic, howe ...

2011

Tools and Frameworks for Big Learning in Scala: Leveraging the Language for High Productivity and Performance

Martin Odersky, Philipp Haller

Implementing machine learning algorithms for large data, such as the Web graph and social networks, is challenging. Even though much research has focused on making sequential algorithms more scalable, their running times continue to be prohibitively long. ...

2011

Naming Anonymous JavaScript Functions

Claude Petitpierre, Salman Mirghasemi

JavaScript developers create programs by calling functions and they use functions to construct objects. JavaScript development tools need to report to developers about those functions and constructors, for example in debugger call-stacks and in object repr ...

2011

Naming Anonymous JavaScript Functions

Claude Petitpierre, Salman Mirghasemi

2011

On A Generic Parallel Collection Framework

Martin Odersky, Tiark Rompf, Aleksandar Prokopec

As the number of cores increases in modern multiprocessors, it is becoming increasingly difficult to write general purpose applications that efficiently utilize this computing power. Most applications manipulate structured data. Modern languages and platfo ...

2011

Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows

Matteo Salani, Ilaria Vacca

The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles' capacity and customer time windows. ...

2011

MaSM: Efficient Online Updates in Data Warehouses

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Data warehouses (DW) have been traditionally optimized for readonly query performance, allowing only offline updates at night, essentially trading off data freshness for performance. The need for 24x7 operations in global markets and the rise of online and ...

2011

Code Completion using Quantitative Type Inhabitation

Viktor Kuncak, Tihomir Gvero, Ruzica Piskac

Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...

2011