Sciweavers

2145 search results - page 345 / 429
» Lax Logical Relations
Sort
View
JFP
2000
163views more  JFP 2000»
13 years 7 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
13 years 7 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones
WWW
2002
ACM
14 years 8 months ago
Model checking cobweb protocols for verification of HTML frames behavior
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...
P. David Stotts, Jaime Navon
SIGMOD
2008
ACM
95views Database» more  SIGMOD 2008»
14 years 8 months ago
Interactive generation of integrated schemas
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney