Philipp Haller

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▶ single authored publications

> Home > Persons > Philipp Haller

Publications

2024
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/programming/Haller24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/programming/Haller24
Philipp Haller:
Lightweight Affine Types for Safe Concurrency in Scala (Keynote). Programming 2024
2022
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/scala/Haller22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/scala/Haller22
Philipp Haller:
Enhancing closures in scala 3 with spores3. SCALA@ECOOP 2022: 22-27
2021
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/ispdc/Haller21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispdc/Haller21
Philipp Haller:
Keynote Lecture : Towards Robust, Large-scale Concurrent and Distributed Programming. ISPDC 2021: xiv
2012
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/agere/Haller12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/agere/Haller12
Philipp Haller:
On the integration of the actor model in mainstream technologies: the scala perspective. AGERE!@SPLASH 2012: 1-6
2010
[b1]
- view
  authority control:
- export record
  dblp key:
  - phd/ch/Haller10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ch/Haller10
Philipp Haller:
Isolated Actors for Race-Free Concurrent Programming. EPFL, Switzerland, 2010

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.