Sciweavers

114 search results - page 6 / 23
» The Formal Consequences of using Variables in CCG Categories
Sort
View
ICFP
2005
ACM
14 years 8 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
GG
2004
Springer
14 years 2 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
POPL
1998
ACM
14 years 1 months ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner
PLDI
2009
ACM
14 years 9 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
LREC
2010
166views Education» more  LREC 2010»
13 years 10 months ago
Video Retrieval in Sign Language Videos : How to Model and Compare Signs?
This paper deals with the problem of finding sign occurrences in a sign language (SL) video. It begins with an analysis of sign models and the way they can take into account the s...
François Lefebvre-Albaret, Patrice Dalle