Strongly-Normalizing Higher-Order Relational Queries

DOI10.46298/lmcs-18(3:23)2022OpenAlexW3037132443MaRDI QIDQ5043580

Wilmer Ricciotti, James Cheney

Publication date: 6 October 2022

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.13451

zbMATH Keywords

strong normalizationlanguage-integrated query\(\top\top\)-liftingnested relational calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

A formalization of SQL with nulls

Uses Software

• Kleisli
• HoTTSQL

Cites Work

• The complexity of higher-order queries
• Principles of programming with complex objects and collection types
• Conservativity of nested relational calculi with internal generic functions
• Query languages for bags and aggregate functions
• Normal forms and conservative extension properties for query languages over collection types
• Dependent types and explicit substitutions: a meta-theoretical development
• A λ-calculus with explicit weakening and explicit substitution
• Optimizing object queries using an effective calculus
• Comprehending monads
• Explicit substitutions
• A practical theory of language-integrated query
• Term Rewriting and Applications
• Typed Lambda Calculi and Applications
• A calculus of lambda calculus contexts
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly-Normalizing Higher-Order Relational Queries