Sciweavers

193 search results - page 33 / 39
» Decidable logics combining heap structures and data
Sort
View
POPL
1997
ACM
13 years 11 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ICFP
2005
ACM
14 years 7 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
IKE
2004
13 years 9 months ago
Integration of Domain-Specific and Domain-Independent Ontologies for Colonoscopy Video Database Annotation
Flexible and effective indexing of video data so as to render it useful in automated inference and datadriven knowledge acquisition is a key problem in knowledge engineering. In t...
Jie Bao, Yu Cao, Wallapak Tavanapong, Vasant Honav...
PLDI
2010
ACM
14 years 4 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
CAV
2010
Springer
172views Hardware» more  CAV 2010»
13 years 11 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers