On the public citation graph

Paramorphisms

https://doi.org/10.1007/bf01211391
0 signed · 86 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10009-1_27openalex-snapshot
How to prove algebraic inductive hypotheses without induction
inferredcites →https://doi.org/10.1007/3-540-51305-1_5openalex-snapshot
Constructing a calculus of programs
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_5openalex-snapshot
Lectures on Constructive Functional Programming
inferredcites →https://doi.org/10.1007/978-3-642-87374-4_1openalex-snapshot
An Introduction to the Theory of Lists
inferredcites →https://doi.org/10.1007/bf01887198openalex-snapshot
Do-it-yourself type theory
inferredcites →https://doi.org/10.1016/0167-6423(90)90023-7openalex-snapshot
Data structures and program transformation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10704973_2openalex-snapshot
Generic Programming
inferred← citeshttps://doi.org/10.1007/11783596_12openalex-snapshot
Fission for Program Comprehension
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_7openalex-snapshot
Encoding Intensional Type Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_10openalex-snapshot
Type-Indexed Data Types
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_11openalex-snapshot
Coinductive Interpreters for Process Calculi
inferred← citeshttps://doi.org/10.1007/3-540-47797-7_5openalex-snapshot
Calculating Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-47797-7_6openalex-snapshot
Algebra of Program Termination
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_5openalex-snapshot
Polytypic Proof Construction
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_62openalex-snapshot
Induce-statements and induce-expressions: Constructs for inductive programming
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_14openalex-snapshot
Induction and recursion on datatypes
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_21openalex-snapshot
A general scheme for breadth-first graph traversal
inferred← citeshttps://doi.org/10.1007/3-540-61628-4_3openalex-snapshot
Polytypic programming
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_73openalex-snapshot
Calculate polytypically!
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_13openalex-snapshot
Toward a calculus for abstract syntax trees
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_11openalex-snapshot
Recursion Schemes in Coq
inferred← citeshttps://doi.org/10.1007/978-3-030-81701-5_3openalex-snapshot
Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-031-16912-0_9openalex-snapshot
Fantastic Morphisms and Where to Find Them
inferred← citeshttps://doi.org/10.1007/978-3-540-27764-4_9openalex-snapshot
Streaming Representation-Changers
inferred← citeshttps://doi.org/10.1007/978-3-540-45191-4_2openalex-snapshot
Chapter 2. Generic Haskell: Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_12openalex-snapshot
The Expression Lemma
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_18openalex-snapshot
Parametric (Co)Iteration vs. Primitive Direcursion
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_1openalex-snapshot
Datatype-Generic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_4openalex-snapshot
Reusing Model Transformations While Preserving Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_13openalex-snapshot
Adjoint Folds and Unfolds
inferred← citeshttps://doi.org/10.1007/978-3-642-32202-0_2openalex-snapshot
Generic Programming with Adjunctions
inferred← citeshttps://doi.org/10.1007/978-3-642-40355-2_11openalex-snapshot
A Duality of Sorts
inferred← citeshttps://doi.org/10.1007/978-3-642-61455-2_12openalex-snapshot
The Algebra of Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_5openalex-snapshot
Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs
inferred← citeshttps://doi.org/10.1007/bf03037300openalex-snapshot
Towards a logic programming methodology based on higher-order predicates
inferred← citeshttps://doi.org/10.1007/s00224-007-9056-zopenalex-snapshot
Datatype-Generic Termination Proofs
inferred← citeshttps://doi.org/10.1007/s10710-019-09347-3openalex-snapshot
Stochastic synthesis of recursive functions made easy with bananas, lenses, envelopes and barbed wire
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00030-5openalex-snapshot
Deriving a class of layer-oriented graph algorithms
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.016openalex-snapshot
Algebraic Specialization of Generic Functions for Recursive Types
inferred← citeshttps://doi.org/10.1016/j.scico.2003.07.001openalex-snapshot
Type-indexed data types
inferred← citeshttps://doi.org/10.1016/j.scico.2006.01.006openalex-snapshot
Metamorphisms: Streaming representation-changers
inferred← citeshttps://doi.org/10.1016/j.scico.2009.12.007openalex-snapshot
Constructing language processors with algebra combinators
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.011openalex-snapshot
Adjoint folds and unfolds—An extended study
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.014openalex-snapshot
Refactoring pattern matching
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00022-2openalex-snapshot
Generic downwards accumulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00355-8openalex-snapshot
Least and greatest fixed points in intuitionistic natural deduction
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00055-6openalex-snapshot
Monadic Corecursion —Definition, Fusion Laws, and Applications—
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80604-2openalex-snapshot
The Sketch of a Polymorphic Symphony
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80906-xopenalex-snapshot
When is a function a fold or an unfold?
inferred← citeshttps://doi.org/10.1017/s0956796810000171openalex-snapshot
Scala for generic programmers
inferred← citeshttps://doi.org/10.1017/s0956796815000258openalex-snapshot
Unifying structured recursion schemes
inferred← citeshttps://doi.org/10.1017/s0956796819000042openalex-snapshot
Folding left and right over Peano numbers
inferred← citeshttps://doi.org/10.1017/s0956796822000156openalex-snapshot
Folding left and right matters: Direct style, accumulators, and continuations
inferred← citeshttps://doi.org/10.1017/s0956796822000168openalex-snapshot
Classical (co)recursion: Mechanics
inferred← citeshttps://doi.org/10.1017/s096012951600027xopenalex-snapshot
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
inferred← citeshttps://doi.org/10.1109/iccl.1998.674166openalex-snapshot
Parallelization via context preservation
inferred← citeshttps://doi.org/10.1109/synasc.2014.32openalex-snapshot
Catamorphism Generation and Fusion Using Coq
inferred← citeshttps://doi.org/10.1109/wcre.2001.957808openalex-snapshot
Reverse program calculation supported by code slicing
inferred← citeshttps://doi.org/10.1142/s012962640200094xopenalex-snapshot
TURING UNIVERSALITY OF RECURSIVE PATTERNS FOR PARALLEL PROGRAMMING
inferred← citeshttps://doi.org/10.1145/1291201.1291208openalex-snapshot
Uniform boilerplate and list processing
inferred← citeshttps://doi.org/10.1145/1411318.1411323openalex-snapshot
Scala for generic programmers
inferred← citeshttps://doi.org/10.1145/1449764.1449799openalex-snapshot
The visitor pattern as a reusable, generic, type-safe component
inferred← citeshttps://doi.org/10.1145/1449955.1449799openalex-snapshot
The visitor pattern as a reusable, generic, type-safe component
inferred← citeshttps://doi.org/10.1145/1596614.1596626openalex-snapshot
Parametric datatype-genericity
inferred← citeshttps://doi.org/10.1145/1863495.1863500openalex-snapshot
Generic storage in Haskell
inferred← citeshttps://doi.org/10.1145/2364394.2364405openalex-snapshot
Sorting with bialgebras and distributive laws
inferred← citeshttps://doi.org/10.1145/2500365.2500578openalex-snapshot
Unifying structured recursion schemes
inferred← citeshttps://doi.org/10.1145/2544174.2500578openalex-snapshot
Unifying structured recursion schemes
inferred← citeshttps://doi.org/10.1145/258948.258964openalex-snapshot
Tupling calculation eliminates multiple data traversals
inferred← citeshttps://doi.org/10.1145/258949.258964openalex-snapshot
Tupling calculation eliminates multiple data traversals
inferred← citeshttps://doi.org/10.1145/2676726.2676989openalex-snapshot
Conjugate Hylomorphisms -- Or
inferred← citeshttps://doi.org/10.1145/2775051.2676989openalex-snapshot
Conjugate Hylomorphisms -- Or
inferred← citeshttps://doi.org/10.1145/2804302.2804315openalex-snapshot
Modular reifiable matching: a list-of-functors approach to two-level types
inferred← citeshttps://doi.org/10.1145/2887747.2804315openalex-snapshot
Modular reifiable matching: a list-of-functors approach to two-level types
inferred← citeshttps://doi.org/10.1145/3018882.3018883openalex-snapshot
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction
inferred← citeshttps://doi.org/10.1145/3409004openalex-snapshot
Strong functional pearl: Harper’s regular-expression matcher in Cedille
inferred← citeshttps://doi.org/10.1145/3473577openalex-snapshot
Algebras for weighted search
inferred← citeshttps://doi.org/10.1145/3563355openalex-snapshot
Intrinsically-typed definitional interpreters à la carte
inferred← citeshttps://doi.org/10.1145/3656381openalex-snapshot
Recursive Program Synthesis using Paramorphisms
inferred← citeshttps://doi.org/10.1145/3703595.3705873openalex-snapshot
Intrinsically Correct Sorting in Cubical Agda
inferred← citeshttps://doi.org/10.1145/3759427.3760377openalex-snapshot
Generic Reduction-Based Interpreters
inferred← citeshttps://doi.org/10.1145/3779209.3779535openalex-snapshot
Hole Refinements for Polymorphic Type-and-Example Driven Synthesis
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:9)2012openalex-snapshot
Refining Inductive Types
inferred← citeshttps://doi.org/10.4204/eptcs.191.8openalex-snapshot
Iteration Algebras for UnQL Graphs and Completeness for Bisimulation
inferred← citeshttps://doi.org/10.4204/eptcs.285.3openalex-snapshot
Generic Programming in OCaml
inferred← citeshttps://doi.org/10.4204/eptcs.66.9openalex-snapshot
Maximum Segment Sum, Monadically (distilled tutorial)
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.