2009 |
59 | EE | Philipp Haller,
Martin Odersky:
Scala Actors: Unifying thread-based and event-based programming.
Theor. Comput. Sci. 410(2-3): 202-220 (2009) |
2008 |
58 | | Michael Pradel,
Martin Odersky:
Scala Roles - A Lightweight Approach Towards Reusable Collaborations.
ICSOFT (PL/DPS/KE) 2008: 13-20 |
57 | EE | Adriaan Moors,
Frank Piessens,
Martin Odersky:
Generics of a higher kind.
OOPSLA 2008: 423-438 |
2007 |
56 | | Shriram Krishnamurthi,
Martin Odersky:
Compiler Construction, 16th International Conference, CC 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 26-30, 2007, Proceedings
Springer 2007 |
55 | EE | Burak Emir,
Qin Ma,
Martin Odersky:
Translation Correctness for First-Order Object-Oriented Pattern Matching.
APLAS 2007: 54-70 |
54 | EE | Philipp Haller,
Martin Odersky:
Actors That Unify Threads and Events.
COORDINATION 2007: 171-190 |
53 | EE | Burak Emir,
Martin Odersky,
John Williams:
Matching Objects with Patterns.
ECOOP 2007: 273-298 |
2006 |
52 | EE | Philipp Haller,
Martin Odersky:
Event-Based Programming Without Inversion of Control.
JMLC 2006: 4-22 |
51 | EE | Vincent Cremet,
François Garillot,
Sergueï Lenglet,
Martin Odersky:
A Core Calculus for Scala Type Checking.
MFCS 2006: 1-23 |
50 | EE | Martin Odersky:
The Scala experiment: can we provide better language support for component systems?
POPL 2006: 166-167 |
49 | EE | Burak Emir,
Sebastian Maneth,
Martin Odersky:
Scalable Programming Abstractions for XML Services.
Research Results of the DICS Program 2006: 103-126 |
2005 |
48 | EE | Martin Odersky,
Matthias Zenger:
Scalable component abstractions.
OOPSLA 2005: 41-57 |
2004 |
47 | | Christian Lengauer,
Don S. Batory,
Charles Consel,
Martin Odersky:
Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23-28, 2003, Revised Papers
Springer 2004 |
46 | | Martin Odersky:
ECOOP 2004 - Object-Oriented Programming, 18th European Conference, Oslo, Norway, June 14-18, 2004, Proceedings
Springer 2004 |
45 | EE | Martin Odersky:
The Scala Experiment - Can We Provide Better Language Support for Component Systems?
APLAS 2004: 364 |
44 | EE | Martin Odersky,
Benjamin C. Pierce:
Guest editorial.
ACM Trans. Program. Lang. Syst. 26(5): 767-768 (2004) |
2003 |
43 | EE | Vincent Cremet,
Martin Odersky:
PiLib: A Hosted Language for Pi-Calculus Style Concurrency.
Domain-Specific Program Generation 2003: 180-195 |
42 | EE | Martin Odersky,
Vincent Cremet,
Christine Röckl,
Matthias Zenger:
A Nominal Theory of Objects with Dependent Types.
ECOOP 2003: 201-224 |
41 | EE | Andrew P. Black,
Vincent Cremet,
Rachid Guerraoui,
Martin Odersky:
An Equational Theory for Transactions.
FSTTCS 2003: 38-49 |
2001 |
40 | | Matthias Zenger,
Martin Odersky:
Extensible Algebraic Datatypes with Defaults.
ICFP 2001: 241-252 |
39 | EE | Martin Odersky,
Christoph Zenger,
Matthias Zenger:
Colored local type inference.
POPL 2001: 41-53 |
38 | EE | Michel Schinz,
Martin Odersky:
Tail call elimination on the Java Virtual Machine.
Electr. Notes Theor. Comput. Sci. 59(1): (2001) |
2000 |
37 | | Yuri Gurevich,
Philipp W. Kutter,
Martin Odersky,
Lothar Thiele:
Abstract State Machines, Theory and Applications, International Workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000, Proceedings
Springer 2000 |
36 | EE | Martin Odersky:
An Introduction to Functional Nets.
APPSEM 2000: 333-377 |
35 | EE | Martin Odersky:
Objects + Views = Components?
Abstract State Machines 2000: 50-68 |
34 | EE | Martin Odersky:
Functional Nets.
ESOP 2000: 1-25 |
33 | | Martin Odersky:
Programming with Functional Nets.
The School of Niklaus Wirth 2000: 173-202 |
1999 |
32 | | Martin Odersky,
Martin Sulzmann,
Martin Wehr:
Type Inference with Constrained Types.
TAPOS 5(1): 35-55 (1999) |
31 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci. 228(1-2): 175-210 (1999) |
1998 |
30 | EE | Kim B. Bruce,
Martin Odersky,
Philip Wadler:
A Statically Safe Alternative to Virtual Types.
ECOOP 1998: 523-549 |
29 | EE | Martin Odersky,
Enno Runne,
Philip Wadler:
Two Ways to Bake Your Pizza - Translating Parameterised Types into Java.
Generic Programming 1998: 114-132 |
28 | EE | Martin Odersky:
Programming with Variable Functions.
ICFP 1998: 105-116 |
27 | EE | Gilad Bracha,
Martin Odersky,
David Stoutamire,
Philip Wadler:
Making the Future Safe for the Past: Adding Genericity to the Java Programming Language.
OOPSLA 1998: 183-200 |
26 | | John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
J. Funct. Program. 8(3): 275-317 (1998) |
1997 |
25 | EE | Martin Odersky,
Philip Wadler:
Pizza into Java: Translating Theory into Practice.
POPL 1997: 146-159 |
24 | | Martin Odersky:
Challenges in Type Systems Research.
SIGPLAN Notices 32(1): 92-93 (1997) |
23 | EE | Kim Marriott,
Martin Odersky:
A Confluent Calculus for Concurrent Constraint Programming.
Theor. Comput. Sci. 173(1): 209-233 (1997) |
1996 |
22 | EE | Martin Odersky,
Konstantin Läufer:
Putting Type Annotations to Work.
POPL 1996: 54-67 |
21 | | Martin Odersky:
Challenges in Type Systems Research.
ACM Comput. Surv. 28(4es): 169 (1996) |
20 | EE | Kim Marriott,
Martin Odersky:
Negative Boolean Constraints.
Theor. Comput. Sci. 160(1&2): 365-380 (1996) |
1995 |
19 | | Kim Marriott,
Martin Odersky:
A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice.
CP 1995: 310-327 |
18 | | Martin Odersky,
Philip Wadler,
Martin Wehr:
A Second Look at Overloading.
FPCA 1995: 135-146 |
17 | | Martin Odersky:
Polarized Name Passing.
FSTTCS 1995: 324-337 |
16 | | Zena M. Ariola,
Matthias Felleisen,
John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
POPL 1995: 233-246 |
15 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
14 | | Richard Helm,
Kim Marriott,
Martin Odersky:
Spatial Query Optimization: From Boolean Constraints to Range Queries.
J. Comput. Syst. Sci. 51(2): 197-210 (1995) |
13 | | Ian A. Mason,
Martin Odersky:
Special Issue on State in Programming Languages - Introduction.
Lisp and Symbolic Computation 8(4): 291-292 (1995) |
1994 |
12 | | Martin Odersky:
A Functional Theory of Local Names.
POPL 1994: 48-59 |
11 | | Kung Chen,
Martin Odersky:
A Type System for a Lambda Calculus with Assignments.
TACS 1994: 347-364 |
10 | EE | Konstantin Läufer,
Martin Odersky:
Polymorphic Type Inference and Abstract Data Types.
ACM Trans. Program. Lang. Syst. 16(5): 1411-1430 (1994) |
1993 |
9 | | Martin Odersky,
Dan Rabin,
Paul Hudak:
Call by Name, Assignment, and the Lambda Calculus.
POPL 1993: 43-56 |
8 | EE | Martin Odersky:
Defining Context-Dependent Syntax Without Using Contexts.
ACM Trans. Program. Lang. Syst. 15(3): 535-562 (1993) |
1992 |
7 | | Martin Odersky:
Observers for Linear Types.
ESOP 1992: 390-407 |
6 | EE | Kung Chen,
Paul Hudak,
Martin Odersky:
Parametric Type Classes.
LISP and Functional Programming 1992: 170-181 |
1991 |
5 | | Konstantin Läufer,
Martin Odersky:
Type Classes are Signatures of Abstract Types.
Declarative Programming 1991: 148-162 |
4 | EE | Richard Helm,
Kim Marriott,
Martin Odersky:
Constraint-Based Query Optimization for Spatial Databases.
PODS 1991: 181-191 |
3 | | Martin Odersky:
How to Make Destructive Updates Less Destructive.
POPL 1991: 25-36 |
1989 |
2 | | Martin Odersky:
MINOS: A New Approach to the Design of an Input/Output Library for Modula-2.
Structured Programming 10(2): 89-105 (1989) |
1987 |
1 | | Martin Odersky:
Einfache und effiziente inkrementelle Syntaxanalyse.
Inform., Forsch. Entwickl. 2(2): 73-82 (1987) |