Results 281 to 290 of about 4,523,229 (316)
Some of the next articles are maybe not open access.
Proceedings of the 2005 conference on Dynamic languages symposium - DLS '05, 2005
We introduce Higher Order Messaging, a higher order programming mechanism for dynamic object-oriented languages. Higher Order Messages allow user-defined message dispatch mechanism to be expressed using an optimally compact syntax that is a natural extension of plain messaging and also have a simple conceptual model.
Marcel Weiher, Stéphane Ducasse
openaire +1 more source
We introduce Higher Order Messaging, a higher order programming mechanism for dynamic object-oriented languages. Higher Order Messages allow user-defined message dispatch mechanism to be expressed using an optimally compact syntax that is a natural extension of plain messaging and also have a simple conceptual model.
Marcel Weiher, Stéphane Ducasse
openaire +1 more source
European Journal of Epidemiology
Higher-order evidence is evidence about evidence. Epidemiologic examples of higher-order evidence include the settings where the study data constitute first-order evidence and estimates of misclassification comprise the second-order evidence (e.g., sensitivity, specificity) of a binary exposure or outcome collected in the main study.
Zivich, Paul N. +5 more
openaire +2 more sources
Higher-order evidence is evidence about evidence. Epidemiologic examples of higher-order evidence include the settings where the study data constitute first-order evidence and estimates of misclassification comprise the second-order evidence (e.g., sensitivity, specificity) of a binary exposure or outcome collected in the main study.
Zivich, Paul N. +5 more
openaire +2 more sources
2014
We propose a distinction between bottom-up and top-down systems of natural logic, with the classical syllogism epitomizing the first and the Monotonicity Calculus the second. We furthermore suggest it useful to view top-down systems as higher-order generalizations of broadly syllogistic systems.
openaire +1 more source
We propose a distinction between bottom-up and top-down systems of natural logic, with the classical syllogism epitomizing the first and the Monotonicity Calculus the second. We furthermore suggest it useful to view top-down systems as higher-order generalizations of broadly syllogistic systems.
openaire +1 more source
Partial higher-order specifications
1991Summary: The classes of extensional models of higher-order partial conditional specifications are studied, with the emphasis on the closure properties of these classes. Further it is shown that any equationally complete inference system for partial conditional specifications may be extended to an inference system for partial higher-order conditional ...
ASTESIANO, EGIDIO, CERIOLI, MAURA
openaire +4 more sources
Psychonomic Bulletin & Review
Affordances are opportunities for action for a given animal (or animals) in a given environment or situation. The concept of affordance has been widely adopted in the behavioral sciences, but important questions remain. We propose a new way of understanding the nature of affordances; in particular, how affordances are related to one another.
Thomas A, Stoffregen, Jeffrey B, Wagman
openaire +2 more sources
Affordances are opportunities for action for a given animal (or animals) in a given environment or situation. The concept of affordance has been widely adopted in the behavioral sciences, but important questions remain. We propose a new way of understanding the nature of affordances; in particular, how affordances are related to one another.
Thomas A, Stoffregen, Jeffrey B, Wagman
openaire +2 more sources
1987
Abstract : In the research on higher order crossings (HOC) they have solved some of the mathematical/statistical problems associated with a certain contraction mapping method for frequency detection and estimation in the presence of noise. They can now tell how to shrink the filters bandwidth to achieve almost sure convergence of the HOC sequence.
openaire +1 more source
Abstract : In the research on higher order crossings (HOC) they have solved some of the mathematical/statistical problems associated with a certain contraction mapping method for frequency detection and estimation in the presence of noise. They can now tell how to shrink the filters bandwidth to achieve almost sure convergence of the HOC sequence.
openaire +1 more source
Typed Higher-Order Narrowing without Higher-Order Strategies
1999We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these systems into ordinary (first-order) rewrite systems and the subsequent application of conventional narrowing strategies.
Sergio Antoy, Andrew P. Tolmach
openaire +1 more source
1996
A redex family is a set of redexes which are ‘created in the same way’. Families specify which redexes should be shared in any so-called optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higher-order term rewriting systems (OHRSs).
openaire +1 more source
A redex family is a set of redexes which are ‘created in the same way’. Families specify which redexes should be shared in any so-called optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higher-order term rewriting systems (OHRSs).
openaire +1 more source
2003
This paper introduces the notion of higher-order inheritance hierarchies. They are useful because they provide well-known benefits of object-orientation at the level of entire hierarchies—benefits which are not available with current approaches. Three facets must be adressed: First, it must be possible to create hierarchies incrementally based on ...
openaire +2 more sources
This paper introduces the notion of higher-order inheritance hierarchies. They are useful because they provide well-known benefits of object-orientation at the level of entire hierarchies—benefits which are not available with current approaches. Three facets must be adressed: First, it must be possible to create hierarchies incrementally based on ...
openaire +2 more sources
Higher-order abstract syntax in classical higher-order logic
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order logic as a metalanguage for an object language with binding operators. It avoids formalizing syntactic details related to variable binding. This paper gives an extension to classical higher-order logic that supports HOAS.
openaire +1 more source