Publications related to Simply typed lambda calculus

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.

Function Passing: A Model for Typed, Distributed Functional Programming

Philipp Haller, Jocelyn Boullier

The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model we call function passing designed to provide a more principled substrate on which to build data-centric distributed systems. A key id ...

Assoc Computing Machinery2016

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Martin Odersky, Vlad Ureche, Cédric Bastin

The ScalaDyno compiler plugin allows fast prototyping with the Scala programming language, in a way that combines the benefits of both statically and dynamically typed languages. Static name resolution and type checking prevent partially-correct code from ...

ACM2014

Complete Completion using Types and Weights

Viktor Kuncak, Ruzica Piskac, Tihomir Gvero, Ivan Kuraj

Developing modern software 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 synthesizes ...

ACM2013

On Complete Completion using Types and Weights

Viktor Kuncak, Ruzica Piskac, Tihomir Gvero, Ivan Kuraj

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 ...

2012

On Fast Code Completion using Type Inhabitation

Viktor Kuncak, Ruzica Piskac, Tihomir Gvero, Ivan Kuraj

2012

Bifurcation Analysis at a Singular Soliton State in Fiber Couplers

Boris Buffoni

The system {-u '' + u = u(3) + lambda v, u(x)= u(-x) is an element of R, x is an element of R, -v '' + v = v(3) + lambda u, v(x) = v(-x) is an element of R, x is an element of R, describes pulses in nonlinear fiber couplers. It has the family (U1+lambda, - ...

Advanced Nonlinear Studies, Inc2012

Code Completion using Quantitative Type Inhabitation

Viktor Kuncak, Ruzica Piskac, Tihomir Gvero

2011

Capabilities for Uniqueness and Borrowing

Martin Odersky, Philipp Haller

An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by ...

Springer2010

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

Simply typed lambda calculus

Graph Chatbot

Chat with Graph Search

Function Passing: A Model for Typed, Distributed Functional Programming

Additional Material for "Unifying Data Representation Transformations"

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Complete Completion using Types and Weights

On Complete Completion using Types and Weights

On Fast Code Completion using Type Inhabitation

Bifurcation Analysis at a Singular Soliton State in Fiber Couplers

Code Completion using Quantitative Type Inhabitation

Capabilities for Uniqueness and Borrowing

Decision Procedures for Algebraic Data Types with Abstractions

Code Completion using Quantitative Type Inhabitation

Capabilities for Uniqueness and Borrowing

Complete Completion using Types and Weights

Bifurcation Analysis at a Singular Soliton State in Fiber Couplers

Additional Material for "Unifying Data Representation Transformations"

On Complete Completion using Types and Weights

On Fast Code Completion using Type Inhabitation

Decision Procedures for Algebraic Data Types with Abstractions

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Function Passing: A Model for Typed, Distributed Functional Programming