Results 1 - 10 of 15,033

Principal Signatures for Higher-order Program Modules

by Mads Tofte, Mds Torre , 1993
"... In this paper we present a lmguage for progq'amming with higher-order modules. t The lmguage, HML, is based on Stmdm'd ML in that it provides structures, signatures md functors. In HML, functors cm be declm'ed inside structures md specified inside signatures; this is not possible in S ..."
Abstract - Cited by 30 (0 self) - Add to MetaCart
In this paper we present a lmguage for progq'amming with higher-order modules. t The lmguage, HML, is based on Stmdm'd ML in that it provides structures, signatures md functors. In HML, functors cm be declm'ed inside structures md specified inside signatures; this is not possible

Principal Siignatures for Higher-order Program. Modules

by Mads Tofte
"... Under the Damas-Milner type discipline for functional languages, every expression has a principal type, if it elaborates at all. In the type .discipline for ML Modules, a signature expression has a principal signature, if it elaborates at all. However, while functions can be higher-order in ML, para ..."
Abstract - Add to MetaCart
Under the Damas-Milner type discipline for functional languages, every expression has a principal type, if it elaborates at all. In the type .discipline for ML Modules, a signature expression has a principal signature, if it elaborates at all. However, while functions can be higher-order in ML

Higher-Order Abstract Syntax

by Frank Pfenning, Conal Elliott
"... We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding informat ..."
Abstract - Cited by 357 (17 self) - Add to MetaCart
We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding

A Type-Theoretic Approach to Higher-Order Modules with Sharing

by Robert Harper, Mark Lillibridge , 1994
"... The design of a module system for constructing and main- taining large programs is a difficult task that raises a number of theoretical and practical issues. A fundamental issue is the management of the flow of information between program units at compile time via the notion of an interface. Experie ..."
Abstract - Cited by 267 (26 self) - Add to MetaCart
The design of a module system for constructing and main- taining large programs is a difficult task that raises a number of theoretical and practical issues. A fundamental issue is the management of the flow of information between program units at compile time via the notion of an interface

Definitional interpreters for higher-order programming languages

by John C. Reynolds - Reprinted from the proceedings of the 25th ACM National Conference , 1972
"... Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include ..."
Abstract - Cited by 338 (2 self) - Add to MetaCart
Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include

Control-Flow Analysis of Higher-Order Languages

by Olin Shivers , 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: data-flow analysis, Scheme, LISP, ML, CPS, type recovery, higher-order functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract - Cited by 365 (10 self) - Add to MetaCart
representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: data-flow analysis, Scheme, LISP, ML, CPS, type recovery, higher-order functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful

Higher-Order Modules and the Phase Distinction

by Robert Harper, John C. Mitchell, Eugenio Moggi - In Seventeenth ACM Symposium on Principles of Programming Languages , 1990
"... Typed λ-calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their relation to each other. In earlier work we introduced a predicative function calculus, XML, for modeling several ..."
Abstract - Cited by 136 (25 self) - Add to MetaCart
several aspects of the Standard ML type system. Following MacQueen, our study focused on the use of dependent types to represent the modularity constructs of Standard ML. In addition to shedding some light on the trade-offs between language features, our analysis suggested that the first-order modules

Distortion invariant object recognition in the dynamic link architecture

by Martin Lades, Jan C. Vorbrüggen, Joachim Buhmann, Christoph v. d. Malsburg, Rolf P. Würtz, Wolfgang Konen - IEEE TRANSACTIONS ON COMPUTERS , 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract - Cited by 637 (80 self) - Add to MetaCart
into higher-order entities. These entities represent a very rich structure and can code for high level objects. In order to demonstrate the capabilities of the Dynamic Link Architecture we implemented a program that can recognize human faces and other objects from video images. Memorized objects

Efficient Software-Based Fault Isolation

by Robert Wahbe, Steven Lucco, Thomas E. Anderson, Susan L. Graham , 1993
"... One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch overhead, In this paper, we present a software approach to implementing fault isolation within a sing ..."
Abstract - Cited by 777 (12 self) - Add to MetaCart
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch overhead, In this paper, we present a software approach to implementing fault isolation within a

A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood

by Stéphane Guindon, Olivier Gascuel , 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract - Cited by 2182 (27 self) - Add to MetaCart
of the topology and branch lengths, only a few iterations are sufficient to reach an optimum. We used extensive and realistic computer simulations to show that the topological accuracy of this new method is at least as high as that of the existing maximum-likelihood programs and much higher than the performance
Results 1 - 10 of 15,033