Sciweavers

20 search results - page 1 / 4
» A Practical Subtyping System For Erlang
Sort
View
ICFP
1997
ACM
13 years 8 months ago
A Practical Subtyping System For Erlang
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
Simon Marlow, Philip Wadler
POPL
2010
ACM
14 years 1 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
ICFP
2010
ACM
13 years 5 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
ICFP
2009
ACM
13 years 11 months ago
Finding race conditions in Erlang with QuickCheck and PULSE
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
Koen Claessen, Michal Palka, Nicholas Smallbone, J...
LICS
1994
IEEE
13 years 8 months ago
Efficient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
Jens Palsberg