Results 271 to 280 of about 19,827,130 (305)
Some of the next articles are maybe not open access.

Higher Order Functions

2014
Functions in Scala are part of the type system. That is, they are part of the system of entities that comprise the types that variables and parameters can reference. Thus just as a parameter can be of type Int, or Boolean, or Person a parameter to a method or a function can be another functions.
openaire   +1 more source

Higher Order Tensors

SIAM Journal on Applied Mathematics, 1976
Higher order tensors, as the name implies, are objects which are generalizations of the mathematical entities encountered in now-classical tensor analysis. In a continuum-mechanical context these objects arise naturally in the development of a theory for the description of the mechanical response of inhomogeneous, materially uniform, nonsimple ...
openaire   +1 more source

Higher-Order Volatility [PDF]

open access: possible, 2005
An important purpose of derivatives modelling is to provide practitioners with actionable measures of risk. The Black and Scholes volatility remains a favourite on trading floors in spite of well-known biases. One popular extension is to make volatility a function of time and the underlying asset price, as in local volatility models.
openaire   +1 more source

Higher-order evidence

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

Partial higher-order specifications

1991
Summary: 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   +6 more sources

Higher order deforestation

1996
Summary: Deforestation is a well-known transformation algorithm which can estiminate intermediate structures from functional programs. In previous work, we have shown how the deforestation algorithm can be extended to handle higher-order programs. A higher-order treeless form of expression was defined to ensure the termination of this algorithm.
openaire   +4 more sources

Typed Higher-Order Narrowing without Higher-Order Strategies

1999
We 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

Higher Order Crossings

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

Higher-order abstract syntax in classical higher-order logic

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009
Higher-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   +2 more sources

Higher-order families

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   +2 more sources

Home - About - Disclaimer - Privacy