On the sequential nature of unification
Journal of Logic Programming
Deciding ML typability is complete for deterministic exponential time
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference for record concatenation and multiple inheritance
Information and Computation
Type inference for records in natural extension of ML
Theoretical aspects of object-oriented programming
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Journal of Computer and System Sciences
A polymorphic record calculus and its compilation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphism and type inference in database programming
ACM Transactions on Database Systems (TODS)
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Foundations of programming languages
Foundations of programming languages
The TSIMMIS Approach to Mediation: Data Models and Languages
Journal of Intelligent Information Systems - Special issue: next generation information technologies and systems
Elements of ML programming (ML97 ed.)
Elements of ML programming (ML97 ed.)
Understanding SQL's stored procedures: a complete guide to SQL/PSM
Understanding SQL's stored procedures: a complete guide to SQL/PSM
Type inference with constrained types
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Type-checking OQL queries in the ODMG type systems
ACM Transactions on Database Systems (TODS)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and programming languages
Types and programming languages
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Typed Sets as a Basis for Object-Oriented Database Schemas
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Querying nested collections
A general framework for hindley/milner type systems with constraints
A general framework for hindley/milner type systems with constraints
On the complexity of deciding typability in the relational algebra
Acta Informatica
A logical algorithm for ML type inference
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Well-definedness and semantic type-checking in the nested relational calculus and XQuery
ICDT'05 Proceedings of the 10th international conference on Database Theory
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 1st International Workshop on Workflow Approaches to New Data-centric Science
Representing mapreduce optimisations in the nested relational calculus
BNCOD'13 Proceedings of the 29th British National conference on Big Data
| Hi-index | 0.00 |
The named nested relational calculus is the canonical query language for the complex object database model and is equipped with a natural static type system. Given an expression in the language, without type declarations for the input variables, there is the problem of whether there are any input type declarations under which the expression is well-typed. Moreover, if there are, then which are they, and what is the corresponding output type for each of these? This problem is solved by a logic-based approach, and the decision problem is shown to be NP-complete.