53 search results - page 3 / 11 » An Iterator Construct for the Refinement Calculus |
CADE
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
ICFP
1996
ACM
13 years 10 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
FOSSACS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
ICPR
2000
IEEE
14 years 6 months ago
2000
IEEE
This paper proposes an approach to 2D gesture recognition that models each gesture as a Finite State Machine (FSM) in spatial-temporal space. The model construction works in a sem...
ESOP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...