Sciweavers

640 search results - page 105 / 128
» Logical types for untyped languages
Sort
View
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
ICSE
2005
IEEE-ACM
14 years 7 months ago
Verifying safety policies with size properties and alias controls
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Cor...
DOLAP
2008
ACM
13 years 9 months ago
Bridging the semantic gap in OLAP models: platform-independent queries
The development of data warehouses is based on a threestage process that starts specifying both the static and dynamic properties of on-line analytical processing (OLAP) applicati...
Jesús Pardillo, Jose-Norberto Mazón,...
JLP
2006
138views more  JLP 2006»
13 years 7 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
VISUALIZATION
1992
IEEE
13 years 11 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul