David D. Lewis. Representation and learning in information retrieval. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, US, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....order parameterized polymorphic type inference. This enables static type checking at compile time, minimizing the need for run time type representations and checking. Hindley Milner type systems [35] have most commonly been incorporated into functional languages like Standard ML(SML) 36] Miranda[58], Hope[11] and Haskell[24] There is considerable anecdotal evidence that polymorphic type checking greatly reduces semantic errors in programs. Certainly, polymorphic types are central to the succinctness of contemporary functional languages, enabling a considerable degree of typesafe ....

....discussion of our human like explanation system. 2.5 Error Reporting Systems Error reporting systems can improve over the W and M algorithms by making explanations comprehensive and more intuitive. There have been several approaches, including Wand s system [59] Johnson and Walz [26] Turner [58], Bernstein and Stark [5] McAdam [32] Dinesh and Tip [14] Choppella [13] and Gomard [17] 2.5.1 Error Reporting Systems 2.5.2 Wand s system Wand s system [59] is the rst system that records the sites that contribute to each type deduction when type errors are detected, and uses this ....

[Article contains additional citation context not shown here]

David Turner. Enhanced error handling for ML. CS4 Project, Department of Computer Science, University of Edinburgh, 1990.

....bounds. For instance, a transposition can not change the number of breakpoints by more than three. Furthermore, one can always find a transposition reducing the number of breakpoints by one. Thus 3 # for all unsigned genomes #. Research by among others Bafna and Pevzner [6] and Christie [22] has given some closer bounds. We use the breakpoint graph terminology and introduce a new function c odd , which given # G n returns the number of cycles of odd length in G(#) Bafna and Pevzner have shown that the inequalities 2 hold for all unsigned genomes. Thus, d trp (#) is ....

David Christie: Genome rearrangement problems, Ph. D. thesis, Department of Computer Science, University of Glasgow (1998).

....and functions. More precisely, a type class is a name for a set of types for which certain predicates, called the methods, are de ned. Type classes were rst introduced in the functional programming languages Haskell and Clean. While Mercury was the rst logic programming language to include them [8], HAL has been recently extended to provide type classes similar to those in Mercury. One major motivation for this extension is that type classes provide a natural way of specifying a constraint solver s capabilities and, therefore, support for plug and play with solvers, which is one of the ....

....Both predicates are de ned in terms of the type parameter T which is required to belong to class ord 1 and thus, by inheritance, to class eq 1. The basic translation schema for predicates whose type declaration contains type class constrains, and for calls to such predicates, is described in [8]. Our running example and (only) benchmark will be the qsort program introduced above. This program will be tested on lists of integers. Thus, we will need the following instance declarations: instance eq(int) where [ pred ( 2) is intequal ] instance ord(int) where [ pred ( 2) is ....

[Article contains additional citation context not shown here]

David Jeery, Fergus Henderson and Zoltan Somogyi. Type classes in Mercury. Technical Report 98/13, Department of Computer Science, University of Melbourne, Melbourne, Australia, September 1998, 22 pages.

....of C and improvements in compilers, many C compilers incorporate most of the traditional lint checks. There are still benefits from additional lint checking, especially in writing portable code. Several academic and commercial systems have been developed to extend or improve lint checking. Check [Spu90], a static checker for ANSI C, provides many useful source checks not performed by standard lint or LCLint. Its most notable similarity to LCLint in contrast to traditional lint is its macro checking (see Section 2.5) Falling between full program verifiers and unaided static checkers are tools ....

....must be enclosed in parentheses when they are used in potentially ambiguous contexts. ffl The type of the macro body must match the return type of the specified function. Static checkers that do not use specifications have also attempted to check macro usage to detect likely problems. Check [Spu90] detects uses of macros involving sideeffecting parameters and operator precedence errors. Errors are reported when a macro is used with a side effecting parameter regardless of whether the particular macro used could behave unexpectedly. Without specifications, however, there is no way to check ....

[Article contains additional citation context not shown here]

David A. Spuler. Check: A better checker for C. Honours Thesis, Department of Computer Science, James Cook University of North Queensland, Austrailia, November 1990.

....the most likely error source. The usage that is in the minority is a candidate for the mistake. However for many errors there is one correct usage and one incorrect usage and it is not clear how often the minority can be isolated, and sometimes the minority usage may be the correct type. Turner [12] considered improved error handling for unbound identifier error reports, source based error reports, and mutually recursive declaration error reports. Similar to Johnson and Walz s method, his method chooses the minority use as the candidate for the error source. Bernstein and Stark give a ....

David Turner. Enhanced error handling for ML. CS4 Project, Department of Computer Science, University of Edinburgh, 1990.

....did not help groups of programmers or learners solve problems involving types. There have been other more minor works on changing the user interface of type inference, for example David A. Turner completed an undergraduate project which modified the error messages produced by the ML Kit compiler [Tur90] The changes were to the text of error messages (rather than highlighting different syntax or announcing different types) For example he produced a specific message if the condition of an if expression was not a boolean. 3.4 Background Reading The background information used in this thesis ....

David A. Turner. Enhanced Error Handling for ML. CS4 Project, Department of Computer Science, The University of Edinburgh, May 1990.

....(#x : # P.t) # = #x : #.P # t # An alternative formulation of the refinement calculus would be to take annotations as primitive. Then we could define set theoretic (as opposed to pertheoretic) specifications as (x:#)P = let x : # in (x P ) 6. 5 Search Calculi The thesis of Pym [Pym90] presents a theory of proof search. One idea developed there (and also in [PW90] is to give a hierarchy of calculi each of which can be regarded as the metatheory of the next and in which the search space for proofs is increasingly constrained. This idea could be applied to the present work on ....

David Pym. Proofs, Search and Computation in General Logic.PhD thesis, Department of Computer Science, University of Edinburgh, 1990.

....AST node types. 5. SML functions for accessing various properties of nodes, such as the type of an expression node or a list of any node s children. The generated C serialization code is incorporated into the Titanium compiler. The ML Lex and ML Yacc deserialization code is translated to SML [7, 22], and together with the other generated SML code, forms the SML Titanium front end. Given a serialized AST from the Titanium compiler, the SML Titanium front end reconstitutes an equivalent representation within the SML universe, ready for traversal and Bane constraint generation. Because so much ....

David R. Tarditi and Andrew W. Appel. ML-Yacc User's Manual. Department of Computer Science, Princeton University, October 6 1994.

....an investigation of the characteristics of good choices of block groups; the search for heuristics suitable for choosing groups of blocks is detailed in Chapter 3. The selected heuristics were implemented in the C compiler Rocket[18] and code was generated for the Unlimited Resource Machine[14] architecture. Chapter 4 shows the results of static analysis of a set of benchmark functions. A goal of the research was to find a heuristic which would, in general, enable efficient schedules to be generated. I have found a set of heuristics which achieve very good results in general. No single ....

....code for cutter itself. 18 3.2 Analysis Technique While Rocket is capable of generating code for several different ILP machines, I chose the URM architecture for this study, because other machines were not easily available to run the generated code. The URM is a simulated superscalar architecture[14] capable of emulating a machine with an arbitrary number of functional units and registers, as well as an arbitrary amount of memory. Rocket was configured for a URM target which uses three integer and two floating point functional units. The scheduler used the late register assignment discipline ....

David Poplawski. The unlimited resource machine (urm). Technical Report CS-TR 95-1, Department of Computer Science, Michigan Technological University, Hougton, MI, February 1995.

....of one or more processors being idle, significantly reducing the frequency of interrupts [FW97c,KS96] Instrumented polling, however, always incurs a minimum overhead of checking for protocol events. Executing protocol threads on a compute processor may pollute the processor s instruction [MPO95] and data [PC94] cache hierarchy. A dedicated policy has the advantage of providing a separate set of instruction and data caches for the protocol thread to use, avoiding cache interference with computation. Cache interference under a multiplexed policy, however, may be minimal depending on the ....

David Mosberger, Larry L. Peterson, and Sean O'Malley. Protocol latency: Mips and reality. Technical Report TR 95-02, Department of Computer Science, University of Arizona, 1995.

....reactive systems which arise as they communicate. Deterministic concurrency deals at present only with reactive systems and the distributed system that derives from it offers a trustable form of distribution across different processors due to the preservation of referential transparency. Icarus [80] also supports strong mobility and has been designed as an extension to Occam [75] Icarus preserves Occam s small granularity but removes its 216 fixed topology with mobile channels. Although it is a dynamic model, it does not provide variable granularity of mobility, once assigned it is fixed. ....

David May and Henk L Muller. Icarus language definition. Technical Report CSTR-97-007, Department of Computer Science, University of Bristol, January 1997.

....This thesis presents the Brisk Machine [54] a machine for executing functional languages, designed to be simple and flexible to support a number of run time execution models for the Brisk compiler. Design considerations have been made to support dynamic loading, deterministic concurrency [23, 51], distribution, debugging tools and logic programming [76] To achieve this, the compiler s intermediate language, the Brisk Kernel Language BKL is simpler than the STG language [100] as evaluation, extension and optimisation issues are relegated to special built in functions. Moreover, function ....

....transparency and thus, equational reasoning cannot be applied [27] This implies that cleaner models of concurrency are still required, at least for purely functional languages, in order to cope with these problems. Chapter 5) One such model of concurrency is deterministic concurrency [51, 23]. This extends the demand driven model, used as the operational basis of functional languages, into one with multiple independent demands in the form of threads that do not share any state. To avoid the non deterministic effects that arise during thread creation, threads are created so that they ....

[Article contains additional citation context not shown here]

David Carter. Deterministic Concurrency. Master's thesis, Department of Computer Science, University of Bristol, September 1994.

....the most likely error source. The usage that is in the minority is a candidate for the mistake. However for many errors there is one correct usage and one incorrect usage and it is not clear how often the minority can be isolated, and sometimes the minority usage may be the correct type. Turner [12] considered improved error handling for unbound identi er error reports, sourcebased error reports, and mutually recursive declaration error reports. Similar to Johnson s method, his method chooses the minority use as the candidate for the error source. Bernstein and Stark give a method of ....

David Turner. Enhanced error handling for ML. CS4 Project, Department of Computer Science, University of Edinburgh, 1990.

.... [JJ89] frequently [Ado97a] Friz [Ado87e] function [Hof90] Fuss [Ano90m] future [Ano91e] Garamond [Ado87c] GDI [Ano92c] generated [Sch91] generates [Ano90r] Generation [RCA 97] Geometry [SS88] Georgia [SIG88] get [Fin92b] Gets [Ano90f, Sne92] GIS [Mit90] Gitex [Cer89] GKS [Mye86] Going [Ano95i] Goudy [Ano87c, Ano90h] grand [WM91] grants [Ano92e] Graphic [Kun90] Graphics [Ano94a, Cra88, Fra91a, Fra91b, GRM97, Koc87a, MD87, SIG88, SIG90a, SIG90b, SS87a, SS88, Ano90q, Kan93, Laf94, McC88, Mil88, Mit90, RMZ86] gray [Woo87b] Great [ST90] Ground [Die93] guia ....

.... [Bro85, McK97, Mul96, Sey88, Sey90] Ink [Ros91, Ano92l] ink jet [Ano92l] inkjet [WM94] inkl [Sok91] ins [Mer97b] Insider [Ano90a] Instantly [McK97] Integrating [Ken96] intelligent [Des89] Interactive [DH96, SIG88, SIG90a, SIG90b] Interactivity [KS95] Interface [SMNF88, DR87, Mye86] interim [Ngu91] International [ICC92, Pal98, SIG90b, SS88, vV88] Internet [Ken96] Interpress [Fra87, Dau86] Interpreter [Ano92f, Ano92a, Cus90] interpretor [QBdR87] Intranets [Ken96] introduces [Ano91c] Introduction [Ado87d, Hol88a, Koo93, Agf92, Jar94, Lan87] Ironing [Ano94b] ....

[Article contains additional citation context not shown here]

David B. Myers. GKS to PostScript interface. Thesis (m.s.), Department of Computer Science, San Francisco State University, San Francisco, CA, USA, 1986. v + 81 + [34] pp. REFERENCES 40

....more than once. To avoid such duplication, timestamp qualifications on containers to the left of the container of the seeding dominant object to have timestamps the timestamp of the DO and qualifications on containers to the right of the seeding container to be the timestamp of the DO [Bra93b]. The notion of left and right is determined by the order in which containers are listed to be joined. Note that the LEAPS compilers did generate multiple tuples as they did not enforce the ideas outlined in this footnote. 58 and the addition of temporal predicates to the where clause of the ....

David Brant. Inferencing on Large Data Sets, Ph.D. dissertation, Department of Computer Sciences, The University of Texas at Austin, 1993.

No context found.

David D. Lewis. Representation and learning in information retrieval. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, US, 1992.

No context found.

David Maulsby. Instructible Agents. PhD thesis, Department of Computer Science, University of Calgary, 1994.

No context found.

David Maulsby. Instructible Agents. PhD thesis, Department of Computer Science, University of Calgary, 1994.

No context found.

Rahul Bhotika, David J. Fleet and Kyriakos N. Kutulakos. A Probabilistic Theory of Occupancy and Emptiness. University of Rochester. Department of Computer Science. Technical Report 753. 2001

No context found.

David Park. The Y-combinator in Scott's #-calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warick, 1976.

No context found.

David Park. The Y-combinator in Scott's #-calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warick, 1976.

No context found.

David Taylor and Peter A. Buhr. POET with C++. Technical report, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1, December 1996. ftp://plg.uwaterloo.ca/pub/MVD/- Poet.ps.gz.

No context found.

David D. Lewis. Representation and learning in information retrieval. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, US, 1992.

No context found.

David A. Turner. Enhanced error handling for ML. CS4 Project, Department of Computer Science, The University of Edinburgh, May 1990.

No context found.

David Mosberger. Memory consistency models. Technical Report TR 93/11, Department of Computer Science, University of Arizona, 1993.

First 50 documents  Next 50

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