S. Aditya. Functional Encapsulation and Type Reconstruction in a Strongly-typed, Polymorphic Language. PhD Thesis. MIT, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Numerical Representations as Purely Functional Data Structures - Ivanovic, Kuncak (2000) (Correct)
....binary number system. The main purpose of this section was to demonstrate the benefits of using analogy with positional number systems. The RAL implementation derived here has O(n) worst case complexity for cons and tail. This corresponds to linear worst case complexity for inc and dec, as in inc [1,1,1,1,1] = 0,0,0,0,0,1] and dec [0,0,0,0,1] 1,1,1,1] In general, incrementing 2 k Gamma 1 takes about k steps, as does decrementing 2 k 1 . Although cases with such cascading carries and cascading borrows are rare and can be amortized in non persistent usage of data structure ( 4] this is ....
....system. The main purpose of this section was to demonstrate the benefits of using analogy with positional number systems. The RAL implementation derived here has O(n) worst case complexity for cons and tail. This corresponds to linear worst case complexity for inc and dec, as in inc [1,1,1,1,1] [0,0,0,0,0,1] and dec [0,0,0,0,1] 1,1,1,1] In general, incrementing 2 k Gamma 1 takes about k steps, as does decrementing 2 k 1 . Although cases with such cascading carries and cascading borrows are rare and can be amortized in non persistent usage of data structure ( 4] this is not true for ....
[Article contains additional citation context not shown here]
S. Aditya. Functional Encapsulation and Type Reconstruction in a Strongly-typed, Polymorphic Language. PhD Thesis. MIT, 1995.
Safe Functional Abstractions in a Polymorphic, Imperative Language - Aditya (1995) (Correct)
....functional manner; it is sometime more appropriate or efficient to have the ability to perform side effects while building a functional data structure. In this paper we describe a type based approach for creating safe, polymorphic, functional data abstractions in an otherwise imperative language [2]. We start with a strongly typed, polymorphic, imperative language such as Id and add a new data encapsulation construct to it called close (see Figure 1) This construct is used to convert locally allocated imperative objects into functional objects by restricting their side effects to a given ....
....object into other external objects. This is where the region expressions prove useful. In our type system, the non null regions within the type of an object provide a conservative static approximation for the set of mutable locations that are dynamically reachable from the given object (shown in [2]) Therefore, the type system is able to detect dynamically escaping write handles to an object by statically searching for its non null region variables within the type of the result or the types of the objects present within the enclosing type environment. This intuition is captured in the ....
[Article contains additional citation context not shown here]
Shail Aditya Gupta. Functional Encapsulation and Type Reconstruction in a Strongly-Typed, Polymorphic Language. PhD thesis, MIT Laboratory for Computer Science, Cambridge, MA 02139, January 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC