Results 1  10
of
4,328,221
An Inflationary Fixed Point Operator in XQuery
"... We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familiar from the context of relational databases. This operator imposes restrictions on the expressible types of recursion, but we show that it is sufficiently versatile to capture a wide range of interest ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familiar from the context of relational databases. This operator imposes restrictions on the expressible types of recursion, but we show that it is sufficiently versatile to capture a wide range
A Characterisation of the LeastFixedPoint Operator By Dinaturality
, 1993
"... The paper addresses the question of when the leastfixedpoint operator, in a cartesian closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a sufficient condition on a cartesian closed full subcategory ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The paper addresses the question of when the leastfixedpoint operator, in a cartesian closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a sufficient condition on a cartesian closed full
Complete Axioms for Categorical Fixedpoint Operators
 In Proceedings of 15th Annual Symposium on Logic in Computer Science
, 2000
"... We give an axiomatic treatment of fixedpoint operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the fre ..."
Abstract

Cited by 42 (6 self)
 Add to MetaCart
We give an axiomatic treatment of fixedpoint operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation
On Gabbay's temporal fixed point operator
 Journal of Theoretical Computer Science
, 1995
"... We discuss the temporal logic ‘USF’, involving Until, Since and the fixed point operator ϕ of Gabbay, with semantics over the natural numbers. We show that any formula not involving Until is equivalent to one without nested fixed point operators. We then prove that USF has expressive power matching ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We discuss the temporal logic ‘USF’, involving Until, Since and the fixed point operator ϕ of Gabbay, with semantics over the natural numbers. We show that any formula not involving Until is equivalent to one without nested fixed point operators. We then prove that USF has expressive power matching
Girard’s! ( ) as a reversible fixedpoint operator
, 2014
"... We give a categorical description of the treatment of the! ( ) exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation ‘forgets types’. We demonstrate that it may be thought of as a fixedpoint operation for reversible logic & computat ..."
Abstract
 Add to MetaCart
We give a categorical description of the treatment of the! ( ) exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation ‘forgets types’. We demonstrate that it may be thought of as a fixedpoint operation for reversible logic &
Parameterizations and FixedPoint Operators on Control Categories
 Fundam. Inform
, 2005
"... The #calculus features both variables and names, together with their binding mechanisms. This means that constructions on open terms are necessarily parameterized in two di#erent ways for both variables and names. Semantically, such a construction must be modeled by a biparameterized family of ope ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
particular and important case, we study parameterizations of uniform fixedpoint operators on control categories, and show bijective correspondences between parameterized fixedpoint operators and nonparameterized ones under uniformity conditions.
On Gabbay's temporal fixed point operator
 Journal of Theoretical Computer Science
, 1992
"... We discuss the temporal logic `USF', involving Until, Since and the fixed point operator ' of Gabbay, with semantics over the natural numbers. We show that any formula not involving Until is equivalent to one without nested fixed point operators. We then prove that USF has expressive p ..."
Abstract
 Add to MetaCart
We discuss the temporal logic `USF', involving Until, Since and the fixed point operator ' of Gabbay, with semantics over the natural numbers. We show that any formula not involving Until is equivalent to one without nested fixed point operators. We then prove that USF has expressive
Introducing Modal Fixed Point Operators into CCSL
, 2005
"... CCSL (short for Coalgebraic Class Specification Language) is a formal specification language, developed jointly at the university of Nijmegen and at TU Dresden. CCSL permits to specify the interface of classes of objectoriented languages by declaring their methods with argument and result types. Fu ..."
Abstract
 Add to MetaCart
. Further, it is possible to restrict the behaivior of the methods with a special form of higher order logic. The master thesis of Jan Rothe enhanced the logic of CCSL with the (infinitary) modal operators Box and Diamond. Assignment: The aim of this project is to enrich CCSL with arbitrary modal fixedpoint
A zeroone law for logic with a fixedpoint operator
 Inform. and Control
"... The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models, b ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
in 1981. The method defines the measure of match between fixedsize feature windows in the past and current frame as the sum of squared intensity differences over the windows. The displacement is then defined as the one that minimizes this sum. For small motions, a linearization of the image intensities
Results 1  10
of
4,328,221