Sciweavers

479 search results - page 88 / 96
» The theory and calculus of aliasing
Sort
View
ICFP
2010
ACM
13 years 8 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
IJRR
2008
73views more  IJRR 2008»
13 years 7 months ago
Optimization of Complex Robot Applications under Real Physical Limitations
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
Matthieu Guilbert, Luc D. Joly, Pierre-Brice Wiebe...