Results 11  20
of
964,974
HigherOrder Charity
, 1997
"... This thesis describes the higherorder Charity programming language which is an extension of firstorder Charity. This results from extending the coinductive datatype definition mechanism to allow a new class of higherorder datatypes with parameterized destructors. This adds significant expressive ..."
Abstract
 Add to MetaCart
This thesis describes the higherorder Charity programming language which is an extension of firstorder Charity. This results from extending the coinductive datatype definition mechanism to allow a new class of higherorder datatypes with parameterized destructors. This adds significant expressive
Extensional HigherOrder Datalog
"... We define a higherorder extension of Datalog based on the Horn fragment of higherorder logic introduced in [Wad91]. Programs of HigherOrder Datalog can be understood declaratively as formulas in extensional higherorder logic, in which (for example) a unary predicate of unary predicates is a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We define a higherorder extension of Datalog based on the Horn fragment of higherorder logic introduced in [Wad91]. Programs of HigherOrder Datalog can be understood declaratively as formulas in extensional higherorder logic, in which (for example) a unary predicate of unary predicates is a
Typed HigherOrder Variant of SROIQ – Why Not?
"... Abstract. We provideTH(SROIQ) a typed higherorder extension ofSROIQ, that is itself a syntactic variant of SROIQ, i.e., it is polynomially reducible into it. We also discuss modelling scenarios in which such a language is useful. 1 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We provideTH(SROIQ) a typed higherorder extension ofSROIQ, that is itself a syntactic variant of SROIQ, i.e., it is polynomially reducible into it. We also discuss modelling scenarios in which such a language is useful. 1
Distortion invariant object recognition in the dynamic link architecture
 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 exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 637 (80 self)
 Add to MetaCart
into higherorder 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
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
calculus of higherorder functions (the Icalculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence
Higherorder functions and structured datatypes
 In WebDB
, 2012
"... Recent proposals from the World Wide Web consortium propose adding support for higherorder functions within the XQuery standard. In this work we explore languages adding higherorder features on top of XML and other structured datatypes. We define a higherorder extension for Core XQuery, along wit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Recent proposals from the World Wide Web consortium propose adding support for higherorder functions within the XQuery standard. In this work we explore languages adding higherorder features on top of XML and other structured datatypes. We define a higherorder extension for Core XQuery, along
HigherOrder Multiset Programming
 in Proc. of the DIMACS workshop on specifications of parallel algorithms, American Mathematical Society, Dimacs series in Discrete Mathematics
, 1994
"... Gamma is a kernel language in which programs are described in terms of multiset transformations following the chemical reaction metaphor. Previous work has demonstrated its significance for the construction of massively parallel programs but also highlighted some limitations. We introduce a highero ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Gamma is a kernel language in which programs are described in terms of multiset transformations following the chemical reaction metaphor. Previous work has demonstrated its significance for the construction of massively parallel programs but also highlighted some limitations. We introduce a higherorder
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 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 maximumlikelihood programs and much higher than the performance
Higherorder Aspects of Logic Programming
"... Abstract. Are higherorder extensions to logic programming needed? We answer this question in the negative by showing that higherorder features are already available in pure logic programming. It is demonstrated that higherorder lambda calculusbased languages can be compositionally embedded in lo ..."
Abstract
 Add to MetaCart
Abstract. Are higherorder extensions to logic programming needed? We answer this question in the negative by showing that higherorder features are already available in pure logic programming. It is demonstrated that higherorder lambda calculusbased languages can be compositionally embedded
Some informational aspects of visual perception
 Psychol. Rev
, 1954
"... The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see M ..."
Abstract

Cited by 643 (2 self)
 Add to MetaCart
Miller [12] for a general discussion and bibliography). Events ordered in time are particularly amenable to informational analysis; thus language sequences are being extensively studied, and other sequences, such as those of music, plainly invite research. In this paper I shall indicate some of the ways
Results 11  20
of
964,974