Sciweavers

159 search results - page 13 / 32
» Type Equivalence Checking in Persistent Object Systems
Sort
View
WWW
2009
ACM
14 years 9 months ago
A method of analyzing credibility based on LOD control of digital maps
Digital maps are widely used and appear on all types of platforms for integrating content. Users can change display region and scale by panning, zooming in, and zooming out on a d...
Daisuke Kitayama, Ryong Lee, Kazutoshi Sumiya
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
14 years 2 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
POPL
2010
ACM
14 years 6 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
POPL
1999
ACM
14 years 28 days ago
Type-Safe Linking and Modular Assembly Language
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
Neal Glew, J. Gregory Morrisett
ICFP
2008
ACM
14 years 8 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig