On the public citation graph
Regular language type inference with term rewriting
0 signed · 40 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/jsco.1996.0002openalex-snapshot
Comparing Curried and Uncurried Rewriting
inferredcites →https://doi.org/10.1007/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/3-540-60178-3_93openalex-snapshot
Automatic presentations of structures
inferredcites →https://doi.org/10.1007/978-3-030-17127-8openalex-snapshot
Foundations of Software Science and Computation Structures
inferredcites →https://doi.org/10.1007/978-3-031-30820-8openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/978-3-319-20615-8_23openalex-snapshot
TIP: Tons of Inductive Problems
inferredcites →https://doi.org/10.1007/978-3-319-26529-2_16openalex-snapshot
Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_4openalex-snapshot
Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_13openalex-snapshot
Abstract Refinement Types
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_31openalex-snapshot
Modular Verification of Higher-Order Functional Programs
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(88)90101-6openalex-snapshot
Principal type scheme and unification for intersection type discipline
inferredcites →https://doi.org/10.1016/j.jlamp.2015.05.003openalex-snapshot
Termination criteria for tree automata completion
inferredcites →https://doi.org/10.1016/j.jsc.2010.01.009openalex-snapshot
Equational approximations for tree automata completion
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.030openalex-snapshot
Flow analysis of lazy higher-order functional programs
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0253905-6openalex-snapshot
The principle type-scheme of an object in combinatory logic
inferredcites →https://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1706299.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferredcites →https://doi.org/10.1145/1926385.1926453openalex-snapshot
Verifying higher-order functional programs with pattern-matching algebraic data types
inferredcites →https://doi.org/10.1145/1993498.1993525openalex-snapshot
Predicate abstraction and CEGAR for higher-order model checking
inferredcites →https://doi.org/10.1145/2535838.2535840openalex-snapshot
Polymorphic functions with set-theoretic types
inferredcites →https://doi.org/10.1145/2951913.2951928openalex-snapshot
Set-theoretic types for polymorphic variants
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_4openalex-snapshot
Pattern Eliminating Transformations
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_6openalex-snapshot
Lifting Numeric Relational Domains to Algebraic Data Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_15openalex-snapshot
Detection of Uncaught Exceptions in Functional Programs by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_10openalex-snapshot
Verification of Programs with ADTs Using Shallow Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_6openalex-snapshot
Complete Abstractions for Verification of Polymorphic Functions with Equality
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_11openalex-snapshot
ReCheck: Automated Contextual Improvement Verifier for Functional Calculi across User-Defined Operational Semantics
inferred← citeshttps://doi.org/10.1007/s10703-024-00456-zopenalex-snapshot
An input–output relational domain for algebraic data types and functional arrays
inferred← citeshttps://doi.org/10.1145/3453483.3454055openalex-snapshot
Beyond the elementary representations of program invariants over algebraic data types
inferred← citeshttps://doi.org/10.1145/3479394.3479404openalex-snapshot
Static analysis of pattern-free properties
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00225openalex-snapshot
Solving Constrained Horn Clauses over ADTs by Finite Model Finding
inferred← citeshttps://doi.org/10.70675/54801bc1z78aaz4054za095z3b915201bd1copenalex-snapshot
Automatic program verification by inference of relational models
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.