Equivalence of datalog queries is undecidable
Journal of Logic Programming
Optimal code motion: theory and practice
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
MultiJava: modular open classes and symmetric multiple dispatch for Java
OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Global optimization by suppression of partial redundancies
Communications of the ACM
Modular typechecking for hierarchically extensible datatypes and functions
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Object-Oriented Multi-Methods in Cecil
ECOOP '92 Proceedings of the European Conference on Object-Oriented Programming
Automatically proving the correctness of compiler optimizations
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Query containment for data integration systems
Journal of Computer and System Sciences - Special issue on PODS 2000
| Hi-index | 0.00 |
In this paper, I survey three projects that are loosely related by the aim to statically understand important properties of a computation. First I describe an extension to mainstream programming languages that solves some common expressiveness limitations while preserving the ability to perform static typechecking modularly. Second I describe a notion of query containment that is appropriate for data integration systems and investigate the complexity of the problem. Finally I describe a domain-specific language for writing compiler optimizations and a strategy for automatically proving the correctness of optimizations written in this language. These three projects explore themes that are prevalent in the work of Paris Kanellakis, including object orientation, type theory, database theory, and declarative languages. I was first exposed to many of these topics through my interaction with Paris.