On the public citation graph
Some algorithmic and proof-theoretical aspects of coercive subtyping
0 signed · 35 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.1007/3-540-19129-1_2openalex-snapshot
Typechecking dependent types and subtypes
inferredcites →https://doi.org/10.1007/3-540-63172-0_45openalex-snapshot
Coercive subtyping in type theory
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1017/s0960129500000256openalex-snapshot
Program specification and data refinement in type theory
inferredcites →https://doi.org/10.1093/logcom/10.4.493openalex-snapshot
Coherence and transitivity of subtyping as entailment
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1142/0867openalex-snapshot
A Perspective in Theoretical Computer Science
inferredcites →https://doi.org/10.1145/263699.263742openalex-snapshot
Typing algorithm in type theory with inheritance
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_13openalex-snapshot
Weak Transitivity in Coercive Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_6openalex-snapshot
Implementation Techniques for Inductive Types in Plastic
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_17openalex-snapshot
Coherence and Transitivity in Coercive Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_8openalex-snapshot
A Kripke-Style Model for the Admissibility of Structural Rules
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_30openalex-snapshot
Anti-Symmetry of Higher-Order Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_14openalex-snapshot
Soundness of the Logical Framework for Its Typed Operational Semantic
inferred← citeshttps://doi.org/10.1007/3-540-48975-4_12openalex-snapshot
Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_18openalex-snapshot
Combining Incoherent Coercions for Σ -Types
inferred← citeshttps://doi.org/10.1007/978-3-642-01918-0_6openalex-snapshot
Contract-Based Discovery and Adaptation of Web Services
inferred← citeshttps://doi.org/10.1007/bfb0097784openalex-snapshot
Coercion synthesis in computer implementations of type-theoretic frameworks
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00062-2openalex-snapshot
Typed operational semantics for higher-order subtyping
inferred← citeshttps://doi.org/10.1017/s0956796806005867openalex-snapshot
A module calculus for Pure Type Systems
inferred← citeshttps://doi.org/10.1017/s0956796899003627openalex-snapshot
Type checking dependent (record) types and subtyping
inferred← citeshttps://doi.org/10.1017/s0960129505005086openalex-snapshot
Anti-symmetry of higher-order subtyping and equality by subtyping
inferred← citeshttps://doi.org/10.1023/a:1010648911114openalex-snapshot
An Implementation of LF with Coercive Subtyping & Universes
inferred← citeshttps://doi.org/10.1093/logcom/10.4.493openalex-snapshot
Coherence and transitivity of subtyping as entailment
inferred← citeshttps://doi.org/10.1145/1328438.1328471openalex-snapshot
A theory of contracts for web services
inferred← citeshttps://doi.org/10.1145/1538917.1538920openalex-snapshot
A theory of contracts for Web services
inferred← citeshttps://doi.org/10.1145/604131.604145openalex-snapshot
Coercive subtyping for the calculus of constructions
inferred← citeshttps://doi.org/10.1145/640128.604145openalex-snapshot
Coercive subtyping for the calculus of constructions
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/917openalex-snapshot
Interactive theorem provers: issues faced as a user and tackled as a developer
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.