Re: [Haskell] Articles on the value of strong typing

On 3/26/07, Jacob Atzen [EMAIL PROTECTED] wrote: This lead me to the question: Are there any scientific empirical studies of the values of static / stronger type systems as found in Haskell, C# or Java in real world settings? Or any studies comparing weaker type systems in terms of programmer

[Haskell] Post-doc position in Martin Odersky's group, EPFL, Switzerland

EPFL Lausanne Programming Methods Group Prof. Martin Odersky We have an open position for a postdoctoral researcher in the Programming Methods Group at EPFL. The research of our group is centered on Scala, a new

[ANN] The Scala programming language

. It requires JDK 1.4 and can run on Windows, MacOS, Linux, Solaris, and most other operating systems. A .net version of Scala is currently under development. For further information and downloads, please visit: scala.epfl.ch == Martin

FOOL 9 Call for Participation

Chambers, University of Washington Erik Ernst, University of Aalborg Giorgio Ghelli, University of Pisa Atsushi Igarashi, University of Tokyo Shriram Krishnamurthi, Brown University Martin Odersky, EPFL (chair) [EMAIL PROTECTED

RE: rank 2-polymorphism and type checking

PS to my earlier message. I am not at all certain that the Odersky/Laufer thing would in fact solve Janis's problem. You want not only a rank-3 type, but also higher-order unification, since you want to instantiate 't' to \c. forall d . (c-d) - d - d Simon, You are correct to

Final CFP: FOOL 9 -- Foundations of Object-Oriented Languages

, Williams College Luca Cardelli, Microsoft Research Kathleen Fisher, ATT Labs Benjamin Pierce, University of Pennsylvania (chair) Didier Remy, INRIA Rocquencourt Program Chair Martin Odersky, Swiss Federal Institute of Technology Lausanne, [EMAIL PROTECTED] Program

CFP: FOOL 9 -- Foundations of Object-Oriented Languages

, Williams College Luca Cardelli, Microsoft Research Kathleen Fisher, ATT Labs Benjamin Pierce, University of Pennsylvania (chair) Didier Remy, INRIA Rocquencourt Program Chair Martin Odersky, Swiss Federal Institute of Technology Lausanne, [EMAIL PROTECTED] Program Committee

Postdoc and PhD Student Position Announcement

EPFL Lausanne Programming Methods Group Prof. Martin Odersky For the Project "Practical Implementations of Functional Nets", funded in part by the Swiss National Science Foundation, we are looking for * Po

Re: Records and type classes

It seems to be the season for records -- three proposals already and I'm going to add a fourth one! Phil Wadler, Martin Wehr and I have recently completed a paper that describes a radical simplification of type classes. We restrict overloading to functions that have the instance type as first

Re: Multiple parameters to classes

Phil Wadler writes: The GRASP team at Glasgow is putting the finishing touches on a paper that formally describes type classes as implemented in Haskell, which you may find helpful. We will post a pointer to this paper when it's done. I hope Mark Jones and Martin Odersky

Re: Existential types

Nigel, I am sorry if I have said something wrong in my posting. I agree that the example I gave was insufficient to disprove soundness of Hope+C. On the other hand, no example can *prove* soundness of a type system. So, let me try a bit further. What happens if I extend your example as follows

Objects with state, or FP + OOP = Haskell++

esis at NYU which is currently being written up. This system also uses Skolemization, but it carefully restricts the scopes of Skolem constants. The problem of designing a type system for existential types that has the principal type property and at the same time does not rely on Skolemization is still