On the public citation graph
Relational algebra by way of adjunctions
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1523openalex-snapshot
Query Languages for Bags and Aggregate Functions
inferredcites →https://doi.org/10.1007/3-540-44503-x_18openalex-snapshot
A Semi-monad for Semi-structured Data (ICDT Version)
inferredcites →https://doi.org/10.1007/978-3-319-03542-0_23openalex-snapshot
Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries
inferredcites →https://doi.org/10.1007/978-3-540-74792-5_12openalex-snapshot
Links: Web Programming Without Tiers
inferredcites →https://doi.org/10.1007/978-3-662-49630-5_30openalex-snapshot
Towards a Formal Theory of Graded Monads
inferredcites →https://doi.org/10.1007/b100112openalex-snapshot
A checker for modal formulas for processes with data
inferredcites →https://doi.org/10.1007/s10990-011-9078-8openalex-snapshot
Generic multiset programming with discrimination-based joins and symbolic Cartesian products
inferredcites →https://doi.org/10.1016/0306-4573(76)90015-7openalex-snapshot
An introduction to database systems
inferredcites →https://doi.org/10.1016/j.apal.2005.09.001openalex-snapshot
Remarks on isomorphisms in typed lambda calculi with empty and sum types
inferredcites →https://doi.org/10.1017/s0956796800003713openalex-snapshot
Generalizing generalized tries
inferredcites →https://doi.org/10.1017/s0956796807006326openalex-snapshot
Applicative programming with effects
inferredcites →https://doi.org/10.1017/s0956796899003585openalex-snapshot
Kleisli, a functional query system
inferredcites →https://doi.org/10.1017/s0960129500000803openalex-snapshot
A generalization of the trie data structure
inferredcites →https://doi.org/10.1023/a:1008705026446openalex-snapshot
How to Comprehend Queries Functionally
inferredcites →https://doi.org/10.1080/00029890.1993.11990393openalex-snapshot
Tarski's High School Identities
inferredcites →https://doi.org/10.1145/1159876.1159884openalex-snapshot
Leveraging .NET meta-programming components from F#
inferredcites →https://doi.org/10.1145/1297027.1297078openalex-snapshot
Confessions of a used programming language salesman
inferredcites →https://doi.org/10.1145/2034675.2034678openalex-snapshot
Bringing back monad comprehensions
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2500365.2500586openalex-snapshot
A practical theory of language-integrated query
inferredcites →https://doi.org/10.1145/2535838.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2578855.2535846openalex-snapshot
Parametric effect monads and semantics of effect systems
inferredcites →https://doi.org/10.1145/2723372.2750543openalex-snapshot
Implicit Parallelism through Deep Language Embedding
inferredcites →https://doi.org/10.1145/2847538.2847542openalex-snapshot
Finally, safely-extensible and efficient language-integrated query
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1201/9781420003345.ch1openalex-snapshot
Introduction to Database Systems
inferredcites →https://doi.org/10.4230/lipics.fscd.2020.15openalex-snapshot
Data-Flow Analyses as Effects and Graded Monads
inferredcites →https://doi.org/10.5860/choice.30-0347openalex-snapshot
Basic category theory for computer scientists
inferredcites →https://doi.org/10.7551/mitpress/1524.001.0001openalex-snapshot
Basic Category Theory for Computer Scientists
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.6302openalex-snapshot
Relational Galois connections between transitive fuzzy digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-50153-2_54openalex-snapshot
Galois Connections Between Unbalanced Structures in a Fuzzy Framework
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102395openalex-snapshot
The optics of language-integrated query
inferred← citeshttps://doi.org/10.1017/s0956796822000041openalex-snapshot
Iterating on multiple collections in synchrony
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00306openalex-snapshot
Mirage: Generating Enormous Databases for Complex Workloads
inferred← citeshttps://doi.org/10.1109/saner48275.2020.9054811openalex-snapshot
Incremental Map-Reduce on Repository History
inferred← citeshttps://doi.org/10.1145/2951913.2951948openalex-snapshot
Datafun: a functional Datalog
inferred← citeshttps://doi.org/10.1145/3434295openalex-snapshot
Generating collection transformations from proofs
inferred← citeshttps://doi.org/10.1145/3527333openalex-snapshot
Functional collection programming with semi-ring dictionaries
inferred← citeshttps://doi.org/10.1145/3610612.3610620openalex-snapshot
Comprehending queries over finite maps
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.