Sciweavers

5096 search results - page 808 / 1020
» Associations as a Language Construct
Sort
View
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 10 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
PLDI
2010
ACM
15 years 10 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
POPL
1994
ACM
15 years 10 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
AOSD
2009
ACM
15 years 10 months ago
Flexible calling context reification for aspect-oriented programming
Aspect-oriented programming (AOP) eases the development of profilers, debuggers, and reverse engineering tools. Such tools frequently rely on calling context information. However,...
Alex Villazón, Walter Binder, Philippe More...