Publication

A Nominal Theory of Objects with Dependent Types

Related publications (57)

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.

Des bactéries contre l'érosion

Rances in the north of Vaud suffered last year from the effects of large soil movement. Rances became the new playground where MeduSoil technology was tested as a remediation for this type of events. This is a decisive new step, after the technology has be ...

2018

Higher-Order Subtyping with Type Intervals

Sandro Stucki

Modern, statically typed programming languages provide various abstraction facilities at both the term- and type-level. Common abstraction mechanisms for types include parametric polymorphism -- a hallmark of functional languages -- and subtyping -- which ...

EPFL2017

A Monometallic Iron(I) Organoferrate

Xile Hu, Matthew Wodrich, Fedor Zhurkin

Tetra-n-butylammonium (TBA) (eta(6)-biphenyl)diphenyfferrate was formed unexpectedly in the reaction of (TBA)(2)[Fe4S4Cl4] with an excess of phenyllithium. This complex belongs to a novel type of organoferrate. ...

American Chemical Society2017

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

Monotonicity Types

In the face of the increasing trend in application development to interact with more and more remote services, and cognizant of the fact that issues arising from data consistency and task coordination are core challenges in distributed programming, the sys ...

2017

Monotonicity Types for Distributed Dataflow

The Lasp programming language provides combinator functions such as Union and Intersection for combining set CRDTs. When designing a CRDT combinator, care must be taken to ensure that the combinator is monotone separately in each of its arguments, so that ...

2017

Robust Type-II Weyl Semimetal Phase in Transition Metal Diphosphides XP2 (X = Mo, W)

Oleg Yazyev, Gabriel Albert Autes

The recently discovered type-II Weyl points appear at the boundary between electron and hole pockets. Type-II Weyl semimetals that host such points are predicted to exhibit a new type of chiral anomaly and possess thermodynamic properties very different fr ...

Amer Physical Soc2016

Dependent Object Types

Nada Amin

A scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. In particular, objects can contain type members, which can be selected as ...

EPFL2016

Implementing Higher-Kinded Types in Dotty

Martin Odersky, Guillaume André Fradji Martres, Dmytro Petrashko

dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are jus ...

ACM2016

SMT-Based Checking of Predicate-Qualified Types for Scala

Viktor Kuncak, Georg Stefan Schmid

We present qualified types for Scala, a form of refinement types adapted to the Scala language. Qualified types allow users to refine base types and classes using predicate expressions. We implemented a type checker for qualified types that is embedded in ...

Assoc Computing Machinery2016