On the public citation graph

TIL: A Type-Directed Optimizing Compiler for ML.

0 signed · 29 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/10704973_6openalex-snapshot
Cayenne — A Language with Dependent Types
inferred← citeshttps://doi.org/10.1007/3-540-45332-6_2openalex-snapshot
Program Representation Size in an Intermediate Language with Intersection and Union Types
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_4openalex-snapshot
Flow-Directed Closure Conversion for Typed Languages
inferred← citeshttps://doi.org/10.1007/3-540-62852-5_20openalex-snapshot
A type-based implementation of a language with distributed scope
inferred← citeshttps://doi.org/10.1007/bfb0055421openalex-snapshot
C--: A portable assembly language
inferred← citeshttps://doi.org/10.1007/bfb0055426openalex-snapshot
Types for register allocation
inferred← citeshttps://doi.org/10.1007/bfb0055512openalex-snapshot
How generic is a generic back end? using MLRISC as a back end for the TIL compiler
inferred← citeshttps://doi.org/10.1007/bfb0055524openalex-snapshot
A type-based semantics for user-defined marshalling in polymorphic languages
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80691-7openalex-snapshot
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80701-7openalex-snapshot
Program Units as Higher-Order Modules
inferred← citeshttps://doi.org/10.1017/s0956796801004245openalex-snapshot
A calculus with polymorphic and polyvariant flow types
inferred← citeshttps://doi.org/10.1017/s0956796801004282openalex-snapshot
Intensional polymorphism in type-erasure semantics
inferred← citeshttps://doi.org/10.1017/s0956796802004446openalex-snapshot
Stack-based typed assembly language
inferred← citeshttps://doi.org/10.1017/s0956796805005605openalex-snapshot
EDUCATIONAL PEARL: A Nanopass framework for compiler education
inferred← citeshttps://doi.org/10.1017/s0956796806006009openalex-snapshot
Multi-return function call
inferred← citeshttps://doi.org/10.1017/s0956796822000090openalex-snapshot
ANF preserves dependent types up to extensional equality
inferred← citeshttps://doi.org/10.1017/s0956796898003086openalex-snapshot
From ML to Ada: Strongly-typed language interoperability via source translation
inferred← citeshttps://doi.org/10.1145/251595.251603openalex-snapshot
ML and beyond
inferred← citeshttps://doi.org/10.1145/2687148.2687152openalex-snapshot
Statically typed string sanitation inside a python
inferred← citeshttps://doi.org/10.1145/268946.268947openalex-snapshot
Higher-order unCurrying
inferred← citeshttps://doi.org/10.1145/268946.268952openalex-snapshot
Correctness of monadic state
inferred← citeshttps://doi.org/10.1145/3689755openalex-snapshot
Realistic Realizability: Specifying ABIs You Can Count On
inferred← citeshttps://doi.org/10.21236/ada358572openalex-snapshot
Stack-Based Typed Assembly Language
inferred← citeshttps://doi.org/10.21236/ada436476openalex-snapshot
Type-Directed Continuation Allocation
inferred← citeshttps://doi.org/10.4995/thesis/10251/13617openalex-snapshot
Abstract Certification of Java Programs in Rewriting Logic
inferred← citeshttps://doi.org/10.5381/jot.2005.4.8.a2openalex-snapshot
Method Inlining, Dynamic Class Loading, and Type Soundness.
inferred← citeshttps://doi.org/10.7146/brics.v11i38.21863openalex-snapshot
Bottom-Up beta-Substitution: Uplinks and lambda-DAGs
inferred← citeshttps://doi.org/10.7146/brics.v9i52.21767openalex-snapshot
A New One-Pass Transformation into Monadic Normal Form
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0019openalex-snapshot
A Type-Theoretic Interpretation of Standard ML
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.