7109 search results - page 206 / 1422 » Process Algebra with Combinators |
134
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
172
click to vote
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
137
click to vote
LFP
1990
15 years 5 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
145
click to vote
ENTCS
2002
15 years 3 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
156
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Analysis of videos of human-object interactions involves understanding human movements, locating and recognizing objects and observing the effects of human movements on those obje...