Strongly-Normalizing Higher-Order Relational Queries
From MaRDI portal
Publication:5043580
DOI10.46298/LMCS-18(3:23)2022OpenAlexW3037132443MaRDI QIDQ5043580FDOQ5043580
Authors: 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
Recommendations
- Query lifting. Language-integrated query for heterogeneous nested collections
- A practical theory of language-integrated query
- Language-integrated query with nested data structures and grouping
- Normal forms and conservative extension properties for query languages over collection types
- The complexity of higher-order queries
Cites Work
- Title not available (Why is that?)
- Typed Lambda Calculi and Applications
- Comprehending monads
- The complexity of higher-order queries
- Explicit substitutions
- A \(\lambda\)-calculus with explicit weakening and explicit substitution
- Title not available (Why is that?)
- Principles of programming with complex objects and collection types
- Conservativity of nested relational calculi with internal generic functions
- A calculus of lambda calculus contexts
- Normal forms and conservative extension properties for query languages over collection types
- Term Rewriting and Applications
- Query languages for bags and aggregate functions
- Optimizing object queries using an effective calculus
- A practical theory of language-integrated query
- Strongly normalizing audited computation
- Dependent types and explicit substitutions: A meta-theoretical development
Cited In (1)
Uses Software
This page was built for publication: Strongly-Normalizing Higher-Order Relational Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043580)
