ERLANG
2009
ACM
14 years 2 months ago
2009
ACM
ERLANG
2009
ACM
14 years 2 months ago
2009
ACM
This paper describes opportunities for automatically modernizing Erlang applications, cleaning them up, eliminating certain bad smells from their code and occasionally also improv...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
Ownership types support information hiding by providing object-based encapsulation. However the static restrictions they impose on object accessibility can limit the expressiveness...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...