On the public citation graph
Bidirectional Typing
0 signed · 118 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-17184-3_44openalex-snapshot
Cartesian closed categories and typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-45465-9_78openalex-snapshot
The Essence of Principal Typings
inferredcites →https://doi.org/10.1007/3-540-56454-3_15openalex-snapshot
A typed foundation for directional logic programming
inferredcites →https://doi.org/10.1007/978-3-540-32254-2_11openalex-snapshot
Normal Natural Deduction Proofs (in Non-classical Logics)
inferredcites →https://doi.org/10.1007/978-3-642-12251-4_5openalex-snapshot
ΠΣ: Dependent Types without the Sugar
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_10openalex-snapshot
Visible Type Application
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/0167-6423(95)00021-6openalex-snapshot
An algorithm for type-checking dependent types
inferredcites →https://doi.org/10.1016/j.entcs.2017.04.010openalex-snapshot
The Polarized λ -calculus
inferredcites →https://doi.org/10.1017/s0956796806006034openalex-snapshot
Practical type inference for arbitrary-rank types
inferredcites →https://doi.org/10.1017/s0956796811000098openalex-snapshot
OutsideIn(X) Modular type inference with local assumptions
inferredcites →https://doi.org/10.1017/s0956796812000408openalex-snapshot
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
inferredcites →https://doi.org/10.1017/s0956796813000270openalex-snapshot
Elaborating intersection and union types
inferredcites →https://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferredcites →https://doi.org/10.1023/a:1005091418752openalex-snapshot
Normal Natural Deduction Proofs (in classical logic)
inferredcites →https://doi.org/10.1109/lics.2009.8openalex-snapshot
Substructural Operational Semantics as Ordered Logic Programming
inferredcites →https://doi.org/10.1145/1040294.1040301openalex-snapshot
Strict bidirectional type checking
inferredcites →https://doi.org/10.1145/1042038.1042041openalex-snapshot
On equivalence and canonical forms in the LF type theory
inferredcites →https://doi.org/10.1145/1111037.1111058openalex-snapshot
Stratified type inference for generalized algebraic data types
inferredcites →https://doi.org/10.1145/1328438.1328483openalex-snapshot
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
inferredcites →https://doi.org/10.1145/1389449.1389469openalex-snapshot
Programming with proofs and explicit contexts
inferredcites →https://doi.org/10.1145/1596627.1596631openalex-snapshot
Greedy bidirectional polymorphism
inferredcites →https://doi.org/10.1145/197320.197383openalex-snapshot
A behavioral notion of subtyping
inferredcites →https://doi.org/10.1145/2364527.2364534openalex-snapshot
Elaborating intersection and union types
inferredcites →https://doi.org/10.1145/2500365.2500582openalex-snapshot
Complete and easy bidirectional typechecking for higher-rank polymorphism
inferredcites →https://doi.org/10.1145/2784731.2784744openalex-snapshot
Elaborating evaluation-order polymorphism
inferredcites →https://doi.org/10.1145/291891.291892openalex-snapshot
Proofs about a folklore let-polymorphic type inference algorithm
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/3009837.3009841openalex-snapshot
On the exp-log normal form of types
inferredcites →https://doi.org/10.1145/3009837.3009865openalex-snapshot
Sums of uncertainty: refinements go gradual
inferredcites →https://doi.org/10.1145/3009837.3009901openalex-snapshot
Deciding equivalence with sums and the empty type
inferredcites →https://doi.org/10.1145/3192366.3192389openalex-snapshot
Guarded impredicative polymorphism
inferredcites →https://doi.org/10.1145/3209108.3209121openalex-snapshot
A theory of linear typings as flows on 3-valent graphs
inferredcites →https://doi.org/10.1145/3290322openalex-snapshot
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
inferredcites →https://doi.org/10.1145/3341716openalex-snapshot
A mechanical formalization of higher-ranked polymorphic type inference
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/604131.604150openalex-snapshot
Guarded recursive datatype constructors
inferredcites →https://doi.org/10.1184/r1/6608582openalex-snapshot
Preliminary design of the programming language Forsythe
inferredcites →https://doi.org/10.2168/lmcs-8(1:29)2012openalex-snapshot
On Irrelevance and Algorithmic Equality in Predicative Type Theory
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
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-031-15298-6_16openalex-snapshot
Additive Types in Quantitative Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-21037-2_8openalex-snapshot
Applicative Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_13openalex-snapshot
Definitional Functoriality for Dependent (Sub)Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_5openalex-snapshot
A Formal Treatment of Bidirectional Typing
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_6openalex-snapshot
Generic bidirectional typing for dependent type theories
inferred← citeshttps://doi.org/10.1007/978-3-031-66997-2_16openalex-snapshot
Partial Proof Terms in the Study of Idealized Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_7openalex-snapshot
Polymorphism with Typed Holes
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_18openalex-snapshot
Proof Search in Classical Propositional Logic with Partial Proof Terms
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_22openalex-snapshot
A Mechanised, Bidirectional Type System for Bit-Width Determination in SystemVerilog
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_14openalex-snapshot
Rhyme: A Data-Centric Multi-paradigm Query Language Based on Functional Logic Metaprogramming
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_14openalex-snapshot
OBRA: Oracle-Based, Relational, Algorithmic Type Verification
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_4openalex-snapshot
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language
inferred← citeshttps://doi.org/10.1007/s11390-025-5978-7openalex-snapshot
An Overview of Cangjie Programming Language
inferred← citeshttps://doi.org/10.1016/j.cola.2025.101323openalex-snapshot
GPotion: Embedding GPU programming in Elixir
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00129openalex-snapshot
eCC++ : A Compiler Construction Framework for Embedded Domain-Specific Languages
inferred← citeshttps://doi.org/10.1109/vl-hcc65237.2025.00019openalex-snapshot
A Type Language for Blockly
inferred← citeshttps://doi.org/10.1145/3477314.3507271openalex-snapshot
Synchronous semantics of multi-mode multi-periodic systems
inferred← citeshttps://doi.org/10.1145/3546196.3550162openalex-snapshot
A Hoare logic style refinement types formalisation
inferred← citeshttps://doi.org/10.1145/3547641openalex-snapshot
Staged compilation with two-level type theory
inferred← citeshttps://doi.org/10.1145/3563310openalex-snapshot
Specification-guided component-based synthesis from effectful libraries
inferred← citeshttps://doi.org/10.1145/3563768.3565550openalex-snapshot
Grammar Inference for Ad Hoc Parsers
inferred← citeshttps://doi.org/10.1145/3563835.3567661openalex-snapshot
The Principles of the Flix Programming Language
inferred← citeshttps://doi.org/10.1145/3586048openalex-snapshot
Live Pattern Matching with Typed Holes
inferred← citeshttps://doi.org/10.1145/3591261openalex-snapshot
Taype: A Policy-Agnostic Language for Oblivious Computation
inferred← citeshttps://doi.org/10.1145/3591271openalex-snapshot
Covering All the Bases: Type-Based Verification of Test Input Generators
inferred← citeshttps://doi.org/10.1145/3607832openalex-snapshot
Special Delivery: Programming with Mailbox Types
inferred← citeshttps://doi.org/10.1145/3609027openalex-snapshot
Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3609027.3609407openalex-snapshot
A Dependently Typed Language with Dynamic Equality
inferred← citeshttps://doi.org/10.1145/3632890openalex-snapshot
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
inferred← citeshttps://doi.org/10.1145/3656433openalex-snapshot
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1145/3677995openalex-snapshot
Proceedings of the 23rd ACM SIGPLAN International Workshop on Erlang
inferred← citeshttps://doi.org/10.1145/3677995.3678189openalex-snapshot
Same Same but Different: A Comparative Analysis of Static Type Checkers in Erlang
inferred← citeshttps://doi.org/10.1145/3689750openalex-snapshot
Effects and Coeffects in Call-by-Push-Value
inferred← citeshttps://doi.org/10.1145/3689782openalex-snapshot
Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional Typing
inferred← citeshttps://doi.org/10.1145/3704864openalex-snapshot
Pantograph: A Fluid and Typed Structure Editor
inferred← citeshttps://doi.org/10.1145/3704909openalex-snapshot
Grove: A Bidirectionally Typed Collaborative Structure Editor Calculus
inferred← citeshttps://doi.org/10.1145/3706056openalex-snapshot
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq
inferred← citeshttps://doi.org/10.1145/3715095openalex-snapshot
Generic Bidirectional Typing for Dependent Type Theories
inferred← citeshttps://doi.org/10.1145/3729308openalex-snapshot
Principal Type Inference under a Prefix: A Fresh Look at Static Overloading
inferred← citeshttps://doi.org/10.1145/3763057openalex-snapshot
Liberating Merges via Apartness and Guarded Subtyping
inferred← citeshttps://doi.org/10.1145/3763117openalex-snapshot
Incremental Bidirectional Typing via Order Maintenance
inferred← citeshttps://doi.org/10.1145/3763144openalex-snapshot
A Lightweight Type-and-Effect System for Invalidation Safety: Tracking Permanent and Temporary Invalidation with Constraint-Based Subtype Inference
inferred← citeshttps://doi.org/10.1145/3765518openalex-snapshot
Type-Safe Compilation of Dynamic Inheritance via Merging
inferred← citeshttps://doi.org/10.1145/3776724openalex-snapshot
A Complementary Approach to Incorrectness Typing
inferred← citeshttps://doi.org/10.1145/3798253openalex-snapshot
Localizing Type Errors for Syntactic Sugar by Lifting
inferred← citeshttps://doi.org/10.1145/3808320openalex-snapshot
Enumerating Ill-Typed Programs for Testing Type Analyzers
inferred← citeshttps://doi.org/10.1145/3830418.3843883openalex-snapshot
Sockeye: Bug-finding and proofs for platform configurations and hardware based on reference manuals
inferred← citeshttps://doi.org/10.1145/3839535openalex-snapshot
P4-SpecTec: Integrating a Language Mechanization Framework into the Real-World P4 Specification
inferred← citeshttps://doi.org/10.4230/lipics.calco.2025.4openalex-snapshot
Distributive Laws of Monadic Containers
inferred← citeshttps://doi.org/10.46298/entics.12286openalex-snapshot
Dependent Type Refinements for Futures
inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot
Generic bidirectional typing in a logical framework for dependent type theories
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.