In computing, a unique type guarantees that an object is used in a single-threaded way, with at most a single reference to it. If a value has aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Edsko de Vries, Adrian Francalanza, Matthew Hennessy
- LINEARITY
- 2014

We view channels as the main form of resources in a message-passing programming paradigm. These channels need to be carefullyâ€¦Â (More)

Is this relevant?

2007

2007

We present a uniqueness type system that is simpler than both Cleanâ€™s uniqueness system and a system we proposed previously. Theâ€¦Â (More)

Is this relevant?

2007

2007

- Anatolii A. Puhalskii, Alexander A. Vladimirov
- Math. Oper. Res.
- 2007

We consider a join-the-shortest-queue model which is as follows. There are K single FIFO servers and M arrival processes. Theâ€¦Â (More)

Is this relevant?

2006

2006

We redefine the uniqueness type system of the functional programming language Clean for the lambda calculus. Our treatment ofâ€¦Â (More)

Is this relevant?

2004

2004

There is a longstanding conjecture, due to Gregory Cherlin and Boris Zilber, that all simple groups of finite Morley rank areâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Erik Barendsen, Sjaak Smetsers
- Mathematical Structures in Computer Science
- 1996

We present two type systems for term graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter isâ€¦Â (More)

Is this relevant?

1995

1995

- Erik Barendsen, Sjaak Smetsers
- PLILP
- 1995

1 I n t r o d u c t i o n Tradit ional functional programming languages are unable to deal with operations with side effectsâ€¦Â (More)

Is this relevant?

1995

1995

- Erik Barendsen, Sjaak Smetsers
- Electr. Notes Theor. Comput. Sci.
- 1995

We present two systems for rst-order typing of graph expressions, in natural deduction style: conventional typing andâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Erik Barendsen, Sjaak Smetsers
- FSTTCS
- 1993

In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certainâ€¦Â (More)

Is this relevant?

1993

1993

- Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
- Dagstuhl Seminar on Graph Transformations inâ€¦
- 1993

In this paper we present a type system for graph rewrite systems uniqueness typing It employs usage information to deduce whetherâ€¦Â (More)

Is this relevant?