Uniqueness Typing Simplified

Vries, Edsko de; Plasmeijer, Rinus; Abrahamson, David

doi:10.1007/978-3-540-85373-2_12

Cited by 40 publications

(20 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…De Vries et al (2008) show, in the setting of uniqueness types, how such inequalities may be represented instead using Boolean logic. For example, if we have a type…”

Section: Related Workmentioning

confidence: 99%

Practical affine types

Tov

Pucella

2011

Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Alms is a general-purpose programming language that supports practical affine types. To offer the expressiveness of Girard's linear logic while keeping the type system light and convenient, Alms uses expressive kinds that minimize notation while maximizing polymorphism between affine and unlimited types.A key feature of Alms is the ability to introduce abstract affine types via ML-style signature ascription. In Alms, an interface can impose stiffer resource usage restrictions than the principal usage restrictions of its implementation. This form of sealing allows the type system to naturally and directly express a variety of resource management protocols from special-purpose type systems.We present two pieces of evidence to demonstrate the validity of our design goals. First, we introduce a prototype implementation of Alms and discuss our experience programming in the language. Second, we establish the soundness of the core language. We also use the core model to prove a principal kinding theorem.

show abstract

“…De Vries et al (2008) show, in the setting of uniqueness types, how such inequalities may be represented instead using Boolean logic. For example, if we have a type…”

Section: Related Workmentioning

confidence: 99%

Practical affine types

Tov

Pucella

2011

Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

show abstract

“…The full typing rules for UniqueType follow those in the Clean language [23] and are outside the scope of this paper. Intuitively, however, if there is a variable x : t, and t : UniqueType, then x can be referred to at most once after it is bound.…”

Section: Second Attempt: Unique Handlesmentioning

confidence: 99%

“…Our approach relies on uniqueness types [23] to enforce the non-aliasing of resources. Uniqueness types are similar to linear types [24], except variables must be referenced at most once, rather than exactly once.…”

Section: Related Workmentioning

confidence: 99%

Type-Driven Development of Concurrent Communicating Systems

Brady

2017

csci

View full text Add to dashboard Cite

Modern software systems rely on communication; for example, mobile applications communicating with a central server, distributed systems coordinating a telecommunications network, or concurrent systems handling events and processes in a desktop application. However, reasoning about concurrent programs is hard since we must reason about each process and the order in which communication might happen between processes. In this paper, I describe a type-driven approach to implementing communicating concurrent programs using the dependently typed programming language Idris. I show how the type system can be used to describe resource access protocols (such as controlling access to a file handle) and verify that the programs correctly follow those protocols. Finally, I show how to use the type system to reason about the order of communication between concurrent processes, ensuring that each end of a communication channel follows a defined protocol.

show abstract

“…In such a way, the Generative Lexicon Theory is used to solve ambiguity problems based on the type constraints expressed in the qualia structures of the lexical items. The relevance of the types in the process of analysis explains why OCLAS is implemented in the functional language CLEAN, since it is extremely efficient to deal with types by virtue of its uniqueness typing and transparency proprieties [23]. Furthermore, the CLEAN counts on a friendly interface with the Parser Combinators used by OCLAS to combine lexical items in the syntactic and semantic analysis, as shown in section 2.3.…”

Section: Main Tools Used In Oclasmentioning

confidence: 99%