Filter Results:
- Full text PDF available (133)
Publication Year
1987
2017
- This year (3)
- Last 5 years (56)
- Last 10 years (92)
Publication Type
Co-author
Journals and Conferences
Key Phrases
Learn More
- Gilad Bracha, Martin Odersky, David Stoutamire, Philip Wadler
- OOPSLA
- 1998
We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps type variables to their bounds, and inserts casts where… (More)
- Philipp Haller, Martin Odersky
- Theor. Comput. Sci.
- 2009
- Martin Odersky, Matthias Zenger
- OOPSLA
- 2005
We identify three programming language abstractions for the construction of reusable components: abstract type members, explicit selftypes, and modular mixin composition. Together, these abstractions enable us to transform an arbitrary assembly of static program parts with hard references between them into a system of reusable components. The transformation… (More)
- Martin Odersky, Philip Wadler
- POPL
- 1997
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain the design space. Nonetheless, Pizza fits smoothly to Java, with… (More)
- Martin Odersky, Philippe Altherr, +7 authors Matthias Zenger
- 2004
Scala fuses object-oriented and functional programming in a statically typed programming language. It is aimed at the construction of components and component systems. This paper gives an overview of the Scala language for readers who are familar with programming methods and programming language design.
- Tiark Rompf, Martin Odersky
- GPCE
- 2010
Good software engineering practice demands generalization and abstraction, whereas high performance demands specialization and concretization. These goals are at odds, and compilers can only rarely translate expressive high-level programs to modern hardware platforms in a way that makes best use of the available resources.
Generative programming is a… (More)
- Kim B. Bruce, Martin Odersky, Philip Wadler
- ECOOP
- 1998
Parametric types and virtual types have recently been proposed as extensions to Java to support genericity. In this paper we investigate the strengths and weaknesses of each. We suggest a variant of virtual types which has similar expressiveness, but supports safe static type checking. This results in a language in which both parametric types and virtual… (More)
- Bruno C. d. S. Oliveira, Adriaan Moors, Martin Odersky
- OOPSLA
- 2010
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important challenges in software engineering and programming languages such as, for example, <i>retroactive extension</i> of programs. They are also recognized as a good mechanism for… (More)
- Martin Odersky, Martin Sulzmann, Martin Wehr
- TAPOS
- 1999
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints. We give a generic type inference algorithm for HM(X). Under suucient conditions on X, type inference will always compute the principal type of a term. We give an extension of our HM(X) systems which deals with subtyping. In particular, the type… (More)
- Martin Odersky, Konstantin Läufer
- POPL
- 1996
We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation… (More)