Related paper "Definite Reference Mutability" presents ReM (Re[ference] M[utability]), a type system that separates mutable references into (1) definitely mutable, and (2) maybe mutable, i.e., references whose mutability is due to inherent approximation. We have implemented ReM and applied it on a large benchmark suite. Results show that ~ 86% of mutable references are definitely mutable. This article describes the tool artifact from the related paper. The purpose of the article and artifact is to allow researchers to reproduce our results, as well as build new type systems upon our code
In programming, data is often considered to be infinitely copiable, arbitrarily discardable, and uni...
This artifact is based on DOL, a Dependent Object-oriented Language featuring dependent types, mutab...
Most proposals for on-the-fly garbage collection ignore the ques-tion of Java’s weak and other refer...
Reference immutability type systems such as Javari and ReIm ensure that a given reference cannot be ...
Reference mutability is a type-based technique for controlling mutation that has been thoroughly stu...
MEng thesisThis paper describes a programming language, Javari, that is capable of expressing and en...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Polymorphism is an important language feature, allowing generic code to operate on many different ty...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
One foundational goal of artificial intelligence is to build intelligent agents which interact with ...
Reference immutability is a type based technique for taming mutation that has long been studied in t...
Our related article presents our novel verification language, called VeriFx. We used VeriFx to imple...
Our paper introduces a systematic approach to the alignment of names in the static structure of a pr...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
In programming, data is often considered to be infinitely copiable, arbitrarily discardable, and uni...
This artifact is based on DOL, a Dependent Object-oriented Language featuring dependent types, mutab...
Most proposals for on-the-fly garbage collection ignore the ques-tion of Java’s weak and other refer...
Reference immutability type systems such as Javari and ReIm ensure that a given reference cannot be ...
Reference mutability is a type-based technique for controlling mutation that has been thoroughly stu...
MEng thesisThis paper describes a programming language, Javari, that is capable of expressing and en...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Polymorphism is an important language feature, allowing generic code to operate on many different ty...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
One foundational goal of artificial intelligence is to build intelligent agents which interact with ...
Reference immutability is a type based technique for taming mutation that has long been studied in t...
Our related article presents our novel verification language, called VeriFx. We used VeriFx to imple...
Our paper introduces a systematic approach to the alignment of names in the static structure of a pr...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
In programming, data is often considered to be infinitely copiable, arbitrarily discardable, and uni...
This artifact is based on DOL, a Dependent Object-oriented Language featuring dependent types, mutab...
Most proposals for on-the-fly garbage collection ignore the ques-tion of Java’s weak and other refer...