Sciweavers

1746 search results - page 247 / 350
» A Constructive Semantics for ALC
Sort
View
POPL
2006
ACM
16 years 4 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
ICFP
2008
ACM
16 years 4 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ICFP
2002
ACM
16 years 4 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
PEPM
2010
ACM
16 years 1 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
EDBT
2009
ACM
174views Database» more  EDBT 2009»
15 years 11 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...