Results 1 - 10 of 12,141

First-class Polymorphism with Type Inference

by Mark P. Jones
"... Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data structures. The same languages o#er parametric polymorphism, which allows the use of values that behave uniformly over a range ..."
Abstract - Cited by 53 (0 self) - Add to MetaCart
first-class polymorphism. This paper uses relationships between types and logic to develop a type system, FCP, that supports first-class polymorphism, type inference, and also first-class abstract datatypes. The immediate result is a more expressive language, but there are also long term implications

First-class phantom types

by James Cheney, Ralf Hinze , 2003
"... Classical phantom types are datatypes in which type constraints are expressed using type variables that do not appear in the datatype cases themselves. They can be used to embed typed languages into Haskell or ML. However, while such encodings guarantee that only well-formed data can be constructed, ..."
Abstract - Cited by 112 (2 self) - Add to MetaCart
, they do not permit type-safe deconstruction without additional tagging and run-time checks. We introduce first-class phantom types, which make such con-straints explicit via type equations. Examples of first-class phantom types include typed type representations and typed higher-order abstract syntax

First-Class Data-type Representation is SchemeXerox

by Norman Adams, Pavel Curtis, Mike Spreitzer - In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation , 1993
"... In most programming language implementations, the compiler has detailed knowledge of the representations of and operations on primitive data types and data-type constructors. In SchemeXerox, this knowledge is almost entirely external to the compiler, in ordinary, procedural user code. The primitive ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
representations and operations are embodied in first-class "representation types" that are constructed and implemented in an abstract and high-level fashion. Despite this abstractness, a few generally-useful optimizing transformations are sufficient to allow the SchemeXerox compiler to generate

Model checking and abstraction

by Peter J. Clarke, Djuradj Babich, Tariq M. King, B. M. Golam Kibria - ACM Transactions on Programming Languages and Systems , 1994
"... software developers are using the Java language as the language of choice on many applications. This is due to the effective use of the object-oriented (OO) paradigm to develop large software projects and the ability of the Java language to support the increasing use of web technologies in business ..."
Abstract - Cited by 742 (55 self) - Add to MetaCart
we present the first study that investigates how the characteristics of a class are combined, thereby providing feedback on how the features provided by Java 1.4.x or earlier and Java 1.5.x or earlier are currently used. The study uses a taxonomy of OO classes that provides a mechanism to catalog any

First-class Synchronous Operations

by John H. Reppy , 1995
"... . The idea of making synchronous operations into first-class values is an important one for supporting abstraction and modularity in concurrent programs. This design principle has been used with great success in the concurrent language CML, but what are the limitations of this approach? This paper e ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
. The idea of making synchronous operations into first-class values is an important one for supporting abstraction and modularity in concurrent programs. This design principle has been used with great success in the concurrent language CML, but what are the limitations of this approach? This paper

Algebraic laws for nondeterminism and concurrency

by Matthew Hennessy, Robin Milner - Journal of the ACM , 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract - Cited by 608 (13 self) - Add to MetaCart
Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth

Basic objects in natural categories

by Eleanor Rosch, Carolyn B. Mervis, Wayne D. Gray, David M. Johnson, Penny Boyes-braem - COGNITIVE PSYCHOLOGY , 1976
"... Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest categ ..."
Abstract - Cited by 892 (1 self) - Add to MetaCart
Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM , 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97

Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions

by Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright - SIAM Journal of Optimization , 1998
"... Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper pr ..."
Abstract - Cited by 598 (3 self) - Add to MetaCart
Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper

The anatomy of the Grid: Enabling scalable virtual organizations.

by Ian Foster , • , Carl Kesselman , Steven Tuecke - The International Journal of High Performance Computing Applications , 2001
"... Abstract "Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. In this article, we define this new field. First, ..."
Abstract - Cited by 2673 (86 self) - Add to MetaCart
Abstract "Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. In this article, we define this new field. First
Results 1 - 10 of 12,141