Travelled to:1 × Belgium
1 × Canada
1 × China
1 × Slovenia
1 × Switzerland
1 × The Netherlands
2 × Italy
2 × Sweden
2 × United Kingdom
21 × USA
3 × France
4 × Germany
Collaborated with:∅ T.Rompf P.Haller P.Wadler M.Zenger V.Ureche A.Prokopec A.Moors D.Petrashko I.Maier L.Rytz A.K.Sujeeth A.Biboudis H.Miller N.Amin P.Hudak R.Helm E.Burmako O.Lhoták K.Olukotun S.Stucki H.Chafi K.Läufer K.J.Brown H.Lee V.Jovanovic C.Talau B.C.d.S.Oliveira F.Piessens B.Emir J.Williams C.Zenger K.B.Bruce M.Wehr D.Rabin K.Chen K.Marruitt K.Marriott N.Stucki M.Jonnalagedda Y.Smaragdakis G.Kossakowski N.G.Bronson P.Bagwell V.Cremet C.Röckl G.Bracha D.Stoutamire M.Wu T.Coppey G.Ofenbeck A.Stojanov M.Püschel Z.M.Ariola M.Felleisen J.Maraist A.Shaikhha V.Nikolaev C.Koch Olivier Blanvillain Fengyun Liu A.Gibbons Z.DeVito P.Hanrahan A.R.Atreya V.Popic
Talks about:type (11) languag (9) program (6) data (6) polymorph (5) object (5) compil (5) stage (5) transform (4) parallel (4)
Person: Martin Odersky
DBLP: Odersky:Martin
Facilitated 3 volumes:
Ed
Ed
EdContributed to:
2015
2015
20152014
20142014201320132013
20132012
2012
20122011
2011201020102010
201020092008200720062005200320012001
200019981998199819971996
19951995199419931992
1992
1991
1991199120182016
20172018Wrote 55 papers:
- OOPSLA-2015-UrecheBSO #ad hoc #automation #data transformation #representation
- Automating ad hoc data representation transformations (VU, AB, YS, MO), pp. 801–820.
- Onward-2015-ProkopecO #composition #distributed #programming
- Isolates, channels, and event streams for composable distributed programming (AP, MO), pp. 171–182.
- PDP-2015-ProkopecPO #performance
- Efficient Lock-Free Work-Stealing Iterators for Data-Parallel Collections (AP, DP, MO), pp. 248–252.
- ECOOP-2014-MillerHO #concurrent #named #type system
- Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution (HM, PH, MO), pp. 308–333.
- GPCE-2014-JovanovicSSNKO #domain-specific language #named
- Yin-yang: concealing the deep embedding of DSLs (VJ, AS, SS, VN, CK, MO), pp. 73–82.
- OOPSLA-2014-AminRO #dependent type
- Foundations of path-dependent types (NA, TR, MO), pp. 233–249.
- OOPSLA-2014-JonnalageddaCSRO #combinator #parsing #performance #staged
- Staged parser combinators for efficient data processing (MJ, TC, SS, TR, MO), pp. 637–653.
- OOPSLA-2014-UrecheBO #data transformation #layout #representation
- Late data layout: unifying data representation transformations (VU, EB, MO), pp. 397–416.
- ECOOP-2013-MaierO #higher-order #incremental #programming
- Higher-Order Reactive Programming with Incremental Lists (IM, MO), pp. 707–731.
- ECOOP-2013-SujeethRBLCPWPJOO #composition #domain-specific language #reuse
- Composition and Reuse with Compiled Domain-Specific Languages (AKS, TR, KJB, HL, HC, VP, MW, AP, VJ, MO, KO), pp. 52–78.
- GPCE-2013-OfenbeckRSOP #generative #library #performance #scala #towards
- Spiral in scala: towards the systematic construction of generators for performance libraries (GO, TR, AS, MO, MP), pp. 125–134.
- GPCE-2013-SujeethGBLROO #declarative #domain-specific language #generative #implementation #named #performance #specification
- Forge: generating a high performance DSL implementation from a declarative specification (AKS, AG, KJB, HL, TR, MO, KO), pp. 145–154.
- OOPSLA-2013-MillerHBO #combinator #generative #object-oriented #performance
- Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization (HM, PH, EB, MO), pp. 183–202.
- OOPSLA-2013-UrecheTO #morphism #named #parametricity #polymorphism #trade-off
- Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations (VU, CT, MO), pp. 73–92.
- POPL-2013-RompfSABJLJOO #compilation #data type #optimisation #source code #staging
- Optimizing data structures in high-level programs: new directions for extensible compilers based on staging (TR, AKS, NA, KJB, VJ, HL, MJ, KO, MO), pp. 497–510.
- ECOOP-2012-KossakowskiARO #domain-specific language #embedded #javascript
- JavaScript as an Embedded DSL (GK, NA, TR, MO), pp. 409–434.
- ECOOP-2012-Odersky #compilation
- When Compilers Are Mirrors (MO), p. 1.
- ECOOP-2012-RytzOH #lightweight #polymorphism
- Lightweight Polymorphic Effects (LR, MO, PH), pp. 258–282.
- PEPM-2012-MoorsRHO #scala
- Scala-virtualized (AM, TR, PH, MO), pp. 117–120.
- PEPM-2012-UrecheRSCO #case study #development #domain-specific language #named
- StagedSAC: a case study in performance-oriented DSL development (VU, TR, AKS, HC, MO), pp. 73–82.
- PPoPP-2012-ProkopecBBO #concurrent #performance
- Concurrent tries with efficient non-blocking snapshots (AP, NGB, PB, MO), pp. 151–160.
- CC-2011-Odersky #parallel #persistent
- Future-Proofing Collections: From Mutable to Persistent to Parallel (MO), p. 1.
- ICML-2011-SujeethLBRCWAOO #domain-specific language #machine learning #named #parallel
- OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning (AKS, HL, KJB, TR, HC, MW, ARA, MO, KO), pp. 609–616.
- ECOOP-2010-HallerO
- Capabilities for Uniqueness and Borrowing (PH, MO), pp. 354–378.
- GPCE-2010-RompfO #approach #code generation #composition #domain-specific language #lightweight #runtime #staging
- Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs (TR, MO), pp. 127–136.
- OOPSLA-2010-ChafiDMRSHOO #parallel
- Language virtualization for heterogeneous parallel computing (HC, ZD, AM, TR, AKS, PH, MO, KO), pp. 835–847.
- OOPSLA-2010-OliveiraMO
- Type classes as objects and implicits (BCdSO, AM, MO), pp. 341–360.
- SAC-2010-RytzO #design #object-oriented #polymorphism #scala
- Named and default arguments for polymorphic object-oriented languages: a discussion on the design implemented in the Scala language (LR, MO), pp. 2090–2095.
- ICFP-2009-RompfMO #continuation #implementation #polymorphism
- Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform (TR, IM, MO), pp. 317–328.
- OOPSLA-2008-MoorsPO
- Generics of a higher kind (AM, FP, MO), pp. 423–438.
- ECOOP-2007-EmirOW
- Matching Objects with Patterns (BE, MO, JW), pp. 273–298.
- POPL-2006-Odersky #component #empirical #question #scala
- The Scala experiment: can we provide better language support for component systems? (MO), pp. 166–167.
- OOPSLA-2005-OderskyZ #abstraction #component #scalability
- Scalable component abstractions (MO, MZ), pp. 41–57.
- ECOOP-2003-OderskyCRZ #dependent type
- A Nominal Theory of Objects with Dependent Types (MO, VC, CR, MZ), pp. 201–224.
- ICFP-2001-ZengerO #algebra #data type
- Extensible Algebraic Datatypes with Defaults (MZ, MO), pp. 241–252.
- POPL-2001-OderskyZZ #type inference
- Colored local type inference (MO, CZ, MZ), pp. 41–53.
- ESOP-2000-Odersky #functional
- Functional Nets (MO), pp. 1–25.
- ECOOP-1998-BruceOW #static typing
- A Statically Safe Alternative to Virtual Types (KBB, MO, PW), pp. 523–549.
- ICFP-1998-Odersky #programming
- Programming with Variable Functions (MO), pp. 105–116.
- OOPSLA-1998-BrachaOSW #java #programming language
- Making the Future Safe for the Past: Adding Genericity to the Java Programming Language (GB, MO, DS, PW), pp. 183–200.
- POPL-1997-OderskyW #java
- Pizza into Java: Translating Theory into Practice (MO, PW), pp. 146–159.
- POPL-1996-OderskyL
- Putting Type Annotations to Work (MO, KL), pp. 54–67.
- FPCA-1995-OderskyWW
- A Second Look at Overloading (MO, PW, MW), pp. 135–146.
- POPL-1995-AriolaFMOW #call-by #λ-calculus
- The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
- POPL-1994-Odersky #functional
- A Functional Theory of Local Names (MO), pp. 48–59.
- POPL-1993-OderskyRH #call-by #λ-calculus
- Call by Name, Assignment, and the λ Calculus (MO, DR, PH), pp. 43–56.
- ESOP-1992-Odersky #linear
- Observers for Linear Types (MO), pp. 390–407.
- LFP-1992-ChenHO #parametricity
- Parametric Type Classes (KC, PH, MO), pp. 170–181.
- CHI-1991-HelmMO #parsing #visual notation
- Building visual language parsers (RH, KM, MO), pp. 105–112.
- PODS-1991-HelmMO #constraints #database #optimisation #query
- Constraint-Based Query Optimization for Spatial Databases (RH, KM, MO), pp. 181–191.
- POPL-1991-Odersky #how
- How to Make Destructive Updates Less Destructive (MO), pp. 25–36.
- GPCE-2018-StuckiBO #metaprogramming #multi #unification
- A practical unification of multi-stage programming and macros (NS, AB, MO), pp. 14–27.
- OOPSLA-2016-PetrashkoULO #graph #morphism #parametricity #polymorphism
- Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
- PLDI-2017-PetrashkoLO #compilation #composition #named #performance #program transformation #using
- Miniphases: compilation using modular and efficient tree transformations (DP, OL, MO), pp. 201–216.
- POPL-2018-OderskyBLBMS #named
- Simplicitly: foundations and applications of implicit function types (MO, OB, FL, AB, HM, SS), p. 29.