David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....p ourStack=Stack, T . T=ourStack. T, Big will be given the following full signature: ourStack p ourStaqk: T I T: Q=St ack. T, push push: T, Int) pop pop:T 4nt, isEmpt y isEmpt y:T Bool , T T: ourStack. T, Note that we have that Big.ourStack.T :Big. T = Stack.T. 130 4.4 Functors Functors translate into dependent functions in the expected way. Consider the following example from the introduction: type type u = X.u r = AX:SlG. t p t=X.t X.t, u p u=X.u, f p f=X.f : t p t: Q=X.t X.t, u p u: Q=X.u, f p f:u ) The coercion on the result type of the ....

....4.6. The type theoretic analysis of the SML modules sys tem was initiated by MacQueen [27] and further developed by Harper and Mitchell [33, 20, 19] This work is summarized and compared with the present work in the introduction. Our language bears some relationship to Russell [4] and Poly [30] but a detailed comparison seems diffi cult in the absence of a type theoretic analysis of these languages (see [21] for an early attempt) In an effort to address the problem of separate compilation, Leroy has independently developed a variant of the SML modules system based on the notion of a ....

David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

....4.6. The type theoretic analysis of the SML modules system was initiated by MacQueen [27] and further developed by Harper and Mitchell [33, 20, 19] This work is summarized and compared with the present work in the introduction. Our language bears some relationship to Russell [4] and Poly [30], but a detailed comparison seems di# cult in the absence of a type theoretic analysis of these languages (see [21] for an early attempt) In an e#ort to address the problem of separate compilation, Leroy has independently developed a variant of the SML modules system based on the notion of a ....

David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

..... val sB : datatype a = A of b . and b = B of a . Each module gives the transparent definition of the datatypes a and b which are equivalent as the language has non generative datatypes. 5 Related work The languages Pebble[3] Russell[2] and Poly[9] explored polymorphism by treating types as data values. These languages have been very influential but all suffered from a lack of formal foundation for defining the semantics of the language. The Ada module system has packages and generics. Generics can take values, functions, and types as ....

D. Matthews. Poly report. Technical report, Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

....A further increase in quality would be possible with more complete mappings, possibly based on extensive profiling of the relative frequency of intermediate instruction usage. The code produced by the augmented Edinburgh ML showed comparable execution speed with the production ML compilers PolyML [6] and Standard ML of New Jersey [2] Edinburgh ML generally gave slightly favourable observed performance, however there are too many mitigating factors (for example different intermediate code generation strategies, the usage of different heap allocation and garbage collecting methods, possibly of ....

David Matthews. Papers on PolyML. Technical report, Computer Laboratory, University of Cambridge, February 1989.

....The general aggregates are structure (labelled cross product, x) and vector. Variants are available for labelled disjoint sums ( For abstraction the type system provides procedures and abstract data types. The Napier88 type system is polymorphic, like ML [71, 13 72] Russell [73] and Poly [74] and uses the existentially quantified types of Mitchell Plotkin [5, 75] for abstract data types. There is deliberately no type inference, to allow for explicit specialisation of polymorphic forms from the persistent store. Thus polymorphic forms may be stored in the persistent store and, when ....

Matthews DCJ. Poly Manual. University of Cambridge, 1985

....X: A. a : c j x j X: a j a(B) j x : A: b j b(a) j (a; b) j a:fst j a:snd A : X j 8X: A j Int j Float j A B j A Theta B Second order calculus is one of the purest and most general approaches to polymorphism, but very few programming languages implement it in its full generality (Poly [11], Quest [4] The ML language proposes a restricted version of it: it requires that universal quantifiers be in prenex position: that all type expressions are of the form 8X 1 : 8X n : A, where A does not contain quantifiers. This makes type inference possible, using the well known ....

David C. J. Matthews. Poly manual. Technical Report 63, Computer Laboratory, University of Cambridge, 1985.

....Section 4.6. The type theoretic analysis of the SML modules system was initiated by MacQueen [27] and further developed by Harper and Mitchell [33, 20, 19] This work is summarized and compared with the present work in the introduction. Our language bears some relationship to Russell [4] and Poly [30], but a detailed comparison seems difficult in the absence of a type theoretic analysis of these languages (see [21] for an early attempt) In an effort to address the problem of separate compilation, Leroy has independently developed a variant of the SML modules system based on the notion of a ....

David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

....Section 4.6. The type theoretic analysis of the SML modules system was initiated by MacQueen [27] and further developed by Harper and Mitchell [33, 20, 19] This work is summarized and compared with the present work in the introduction. Our language bears some relationship to Russell [4] and Poly [30], but a detailed comparison seems difficult in the absence of a type theoretic analysis of these languages (see [21] for an early attempt) In an effort to address the problem of separate compilation, Leroy has independently developed a variant of the SML modules system based on the notion of a ....

David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

....ML is an excellent language for writing real programs. Our compiler s front end is quite carefully designed to be fast, but the back end needs (and is receiving) further work to make it compile faster. The quality of our compiled code is extremely good, as figures 1 and 2 show. We tested Poly ML[24] and SML NJ on six real programs[4] whose average size was about 2000 nonblank noncomment lines of source. Figure 1 shows the results on a SparcStation 2 (the only modern platform on which they both run) Indeed, Poly ML compiles about 43 faster (when it doesn t blow up) but SML NJ programs ....

David C. J. Matthews. Papers on Poly/ML. Technical Report T.R. No. 161, Computer Laboratory, University of Cambridge, February 1989.

....with a well understood semantics [MTH90] Several projects have enriched the language with primitives or constructions for concurrency, primarily to provide a better way to describe parallel applications such as interactive multi windows systems. LCS [BL94] designed at LAAS CNRS, and Poly ML [Mat89] being developed at the University of Edinburgh, are such languages. Our investigations concern parallel implementations of these languages in order to speed up the execution of parallel programs. The parallel machines we are interested in are networks of workstations, because they are widely ....

David C. J. Matthews. Papers on Poly/ML. Technical Report 161, Computer Laboratory, University of Cambridge, 1989

....approach. People chose the OO way not because it was not possible to achieve the same results using conventional methods, but because it was convenient and fitted well to their way of thinking. Similarly, by using mobile agents we can obtain the same (or better) results with much less effort [6]. It will be very useful to keep an open eye on this technology. 15 7 ....

David Alan Halls - Applying Mobile Code to Distributed Systems, PhD Thesis, Computer Laboratory, University of Cambridge, June 1997 - http://www.cl.cam.ac.uk/users/dah28

No context found.

David C. J. Matthews. POLY report. Technical Report 28, Computer Laboratory, University of Cambridge, 1982.

No context found.

David C. J. Matthews. Papers on Poly/ML. Technical Report T.R. No. 161, Computer Laboratory, University of Cambridge, February 1989.

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