Publication

Foundations of Implicit Function Types

Publications associées (38)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Digital transformation and  open innovation ecosystems in the tilm industry: the case of the Movieday platform

Christopher Tucci, Gianluigi Viscusi

Digital technologies are transforming the film industry. Up until roughly a decade ago, the business model for film exhibition was based on theatrical release in combination with television sales and home cinema releases (video and DVD). Recently, many que ...

2017

Digital transformation and open innovation ecosystems in the tilm industry: the case of the Movieday platform

Christopher Tucci, Gianluigi Viscusi

2017

Decrypting Local Type Inference

Hubert Plociniczak

Statically typed languages verify programs at compile-time. As a result many programming mistakes are detected at an early stage of development. A programmer does not have to specify types for every single term manually, however. Many programming languages ...

EPFL2016

Translating Scala Programs to Isabelle/HOL, Automated Reasoning

Viktor Kuncak

We present a trustworthy connection between the Leon verification system and the Isabelle proof assistant. Leon is a system for verifying functional Scala programs. It uses a variety of automated theorem provers (ATPs) to check verification conditions (VCs ...

2016

Scalable and Reactive Programming for Semantic Web Developers

Jean Paul Calbimonte Perez

The Semantic Web brings a powerful set of concepts, standards and ideas that are already changing the shape of the Web. However, in order to put these notions into practice we need to translate them into code. That is why the broad notion of programming th ...

CEUR-WS2015

Programming play into public space?

Sonia Monique Curnier

With the rise of the “ludic city”, the work of Roger Caillois and Marc Breviglieri allows us to question the paradoxical character of planning and “programming” playfulness into public spaces, which should allow room for manoeuvre and encourage improvisati ...

2015

Containers and Aggregates, Mutators and Isolates for Reactive Programming

Martin Odersky, Philipp Haller, Aleksandar Prokopec

Many programs have an inherently reactive nature imposed by the functional dependencies between their data and external events. Classically, these dependencies are dealt with using callbacks. Reactive programming with first-class reactive values is a parad ...

2014

Scala.js: Type-Directed Interoperability with Dynamically Typed Languages

Sébastien Jean R Doeraene

Interoperability between statically typed and dynamically typed languages is increasingly important, as can be witnessed by the many statically typed languages targeting JavaScript. Interoperating with both the object-oriented and functional features of Ja ...

2013

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