On the public citation graph

Simple imperative polymorphism

https://doi.org/10.1007/bf01018828
0 signed · 188 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.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1006/inco.1996.0054openalex-snapshot
Standard ML–NJ Weak Polymorphism and Imperative Constructs
inferredcites →https://doi.org/10.1007/3-540-55253-7_28openalex-snapshot
Typing references by effect inference
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(92)90026-8openalex-snapshot
Commentary on standard ML
inferredcites →https://doi.org/10.1016/0890-5401(90)90018-dopenalex-snapshot
Type inference for polymorphic references
inferredcites →https://doi.org/10.1017/s095679680000085xopenalex-snapshot
Typing first-class continuations in ML
inferredcites →https://doi.org/10.1017/s0956796800001593openalex-snapshot
Weak polymorphism can be sound
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.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1109/lics.1992.185530openalex-snapshot
The type and effect discipline
inferredcites →https://doi.org/10.1109/lics.1993.287604openalex-snapshot
Standard ML-NJ weak polymorphism and imperative constructs
inferredcites →https://doi.org/10.1145/158511.158630openalex-snapshot
Explicit polymorphism and CPS conversion
inferredcites →https://doi.org/10.1145/158511.158632openalex-snapshot
Polymorphism by name for references and continuations
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/99370.99393openalex-snapshot
A simple semantics for ML polymorphism
inferredcites →https://doi.org/10.1145/99583.99608openalex-snapshot
Typing first-class continuations in ML
inferredcites →https://doi.org/10.1145/99583.99622openalex-snapshot
Polymorphic type inference and assignment
inferredcites →https://doi.org/10.21236/ada267839openalex-snapshot
Standard ML Weak Polymorphism Can Be Sound
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2407openalex-snapshot
Adtpp: lightweight efficient safe polymorphic algebraic data types for C
inferred← citeshttps://doi.org/10.1006/inco.1999.2831openalex-snapshot
Type-Directed Specialization of Polymorphism
inferred← citeshttps://doi.org/10.1007/11559306_14openalex-snapshot
A Concurrent Lambda Calculus with Futures
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_15openalex-snapshot
JOIN(X): Constraint-Based Type Inference for the Join-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_2openalex-snapshot
Monads and Effects
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_24openalex-snapshot
Alias Types
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_47openalex-snapshot
Towards an ML-style polymorphic type system for C
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_13openalex-snapshot
Handling Polymorphic Algebraic Effects
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_6openalex-snapshot
Pragmatic Gradual Polymorphism with References
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_9openalex-snapshot
A Type System for Effect Handlers and Dynamic Labels
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_12openalex-snapshot
Programming with Union, Intersection, and Negation Types
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_15openalex-snapshot
Relaxing the Value Restriction
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_25openalex-snapshot
Extensional Polymorphism by Flow Graph Dispatching
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_10openalex-snapshot
Polymorphic versus Monomorphic Flow-Insensitive Points-To Analysis for C
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_16openalex-snapshot
Polymorphic Delimited Continuations
inferred← citeshttps://doi.org/10.1007/978-3-540-89330-1_21openalex-snapshot
Sound and Complete Type Inference for a Systems Programming Language
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_10openalex-snapshot
A Rewriting Logic Approach to Type Inference
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_19openalex-snapshot
A Classical Realizability Model for a Semantical Value Restriction
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_18openalex-snapshot
Extensible Datasort Refinements
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_29openalex-snapshot
A Classical Sequent Calculus with Dependent Types
inferred← citeshttps://doi.org/10.1007/bfb0030629openalex-snapshot
A type-based approach to program security
inferred← citeshttps://doi.org/10.1007/bfb0053589openalex-snapshot
Reflections on the design of a specification language
inferred← citeshttps://doi.org/10.1007/bfb0055063openalex-snapshot
Existential types: Logical relations and operational equivalence
inferred← citeshttps://doi.org/10.1007/s10990-013-9095-xopenalex-snapshot
An approach to completing variable names for implicitly typed functional languages
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.001openalex-snapshot
On the unity of duality
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.010openalex-snapshot
Completeness and partial soundness results for intersection and union typing for λ¯μμ
inferred← citeshttps://doi.org/10.1016/j.ic.2014.01.004openalex-snapshot
Safe typing of functional logic programs with opaque patterns and local bindings
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104948openalex-snapshot
Polymorphic lambda calculus with context-free session types
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101083openalex-snapshot
Kind inference for the FreeST programming language
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.016openalex-snapshot
A concurrent lambda calculus with futures
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00030-0openalex-snapshot
A sound polymorphic type system for a dialect of C
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80779-5openalex-snapshot
Syntactic Type Soundness for HM(X)
inferred← citeshttps://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferred← citeshttps://doi.org/10.1017/s0956796800003683openalex-snapshot
A modular module system
inferred← citeshttps://doi.org/10.1017/s0956796803004775openalex-snapshot
The recursive record semantics of objects revisited
inferred← citeshttps://doi.org/10.1017/s0956796805005617openalex-snapshot
Meta-programming through typeful code representation
inferred← citeshttps://doi.org/10.1017/s0956796806006216openalex-snapshot
Dependent ML An approach to practical programming with dependent types
inferred← citeshttps://doi.org/10.1017/s0956796811000098openalex-snapshot
OutsideIn(X) Modular type inference with local assumptions
inferred← citeshttps://doi.org/10.1017/s0956796812000366openalex-snapshot
Syntactic soundness proof of a type-and-capability system with hidden state
inferred← citeshttps://doi.org/10.1017/s0956796814000264openalex-snapshot
F-ing modules
inferred← citeshttps://doi.org/10.1017/s0956796816000320openalex-snapshot
No value restriction is needed for algebraic effects and handlers
inferred← citeshttps://doi.org/10.1017/s0956796818000205openalex-snapshot
1ML – Core and modules united
inferred← citeshttps://doi.org/10.1017/s0956796824000054openalex-snapshot
Signature Restriction for Polymorphic Algebraic Effects
inferred← citeshttps://doi.org/10.1017/s0956796898003086openalex-snapshot
From ML to Ada: Strongly-typed language interoperability via source translation
inferred← citeshttps://doi.org/10.1017/s0960129512000035openalex-snapshot
A step-indexed Kripke model of hidden state
inferred← citeshttps://doi.org/10.1023/a:1006285817788openalex-snapshot
Certification of a Type Inference Tool for ML: Damas–Milner within Coq
inferred← citeshttps://doi.org/10.1109/lics.2017.8005109openalex-snapshot
A monad for full ground reference cells
inferred← citeshttps://doi.org/10.1145/1086365.1086383openalex-snapshot
Simple, partial type-inference for System F based on type-containment
inferred← citeshttps://doi.org/10.1145/1090189.1086383openalex-snapshot
Simple, partial type-inference for System F based on type-containment
inferred← citeshttps://doi.org/10.1145/1111037.1111047openalex-snapshot
Polymorphic regular tree types and patterns
inferred← citeshttps://doi.org/10.1145/1111037.1111060openalex-snapshot
A polymorphic modal type system for lisp-like multi-staged languages
inferred← citeshttps://doi.org/10.1145/1111320.1111047openalex-snapshot
Polymorphic regular tree types and patterns
inferred← citeshttps://doi.org/10.1145/1111320.1111060openalex-snapshot
A polymorphic modal type system for lisp-like multi-staged languages
inferred← citeshttps://doi.org/10.1145/1159876.1159881openalex-snapshot
Type-safe distributed programming for OCaml
inferred← citeshttps://doi.org/10.1145/1186632.1186635openalex-snapshot
Flow-insensitive type qualifiers
inferred← citeshttps://doi.org/10.1145/1215995.1216002openalex-snapshot
Type inference for unboxed types and first class mutability
inferred← citeshttps://doi.org/10.1145/1292535.1292538openalex-snapshot
Efficient type inference using ranked type variables
inferred← citeshttps://doi.org/10.1145/1292597.1292604openalex-snapshot
The swiss coercion
inferred← citeshttps://doi.org/10.1145/1411304.1411313openalex-snapshot
Many holes in hindley-milner
inferred← citeshttps://doi.org/10.1145/1481848.1481852openalex-snapshot
Refinement types and computational duality
inferred← citeshttps://doi.org/10.1145/1570506.1570507openalex-snapshot
Blame for all
inferred← citeshttps://doi.org/10.1145/1708016.1708023openalex-snapshot
Let should not be generalized
inferred← citeshttps://doi.org/10.1145/1708016.1708028openalex-snapshot
F-ing modules
inferred← citeshttps://doi.org/10.1145/182409.182485openalex-snapshot
A practical soft type system for Scheme
inferred← citeshttps://doi.org/10.1145/1863523.1863531openalex-snapshot
Experience report
inferred← citeshttps://doi.org/10.1145/1925844.1926409openalex-snapshot
Blame for all
inferred← citeshttps://doi.org/10.1145/1926385.1926409openalex-snapshot
Blame for all
inferred← citeshttps://doi.org/10.1145/2088456.1863531openalex-snapshot
Experience report
inferred← citeshttps://doi.org/10.1145/2103746.2103771openalex-snapshot
An approach to completing variable names for implicitly typed functional languages
inferred← citeshttps://doi.org/10.1145/229542.229544openalex-snapshot
Polymorphic typing of variables and references
inferred← citeshttps://doi.org/10.1145/239912.239917openalex-snapshot
A practical soft type system for scheme
inferred← citeshttps://doi.org/10.1145/2429069.2429074openalex-snapshot
The sequential semantics of producer effect systems
inferred← citeshttps://doi.org/10.1145/2480359.2429074openalex-snapshot
The sequential semantics of producer effect systems
inferred← citeshttps://doi.org/10.1145/253228.253351openalex-snapshot
Lackwit
inferred← citeshttps://doi.org/10.1145/258915.258937openalex-snapshot
Componential set-based analysis
inferred← citeshttps://doi.org/10.1145/258916.258937openalex-snapshot
Componential set-based analysis
inferred← citeshttps://doi.org/10.1145/2641638.2641653openalex-snapshot
MLF
inferred← citeshttps://doi.org/10.1145/2676726.2676992openalex-snapshot
Principal Type Schemes for Gradual Programs
inferred← citeshttps://doi.org/10.1145/2678015.2682545openalex-snapshot
Imperative Polymorphism by Store-Based Types as Abstract Interpretations
inferred← citeshttps://doi.org/10.1145/268946.268954openalex-snapshot
From system F to typed assembly language
inferred← citeshttps://doi.org/10.1145/271510.271523openalex-snapshot
Polymorphic splitting
inferred← citeshttps://doi.org/10.1145/2775051.2676992openalex-snapshot
Principal Type Schemes for Gradual Programs
inferred← citeshttps://doi.org/10.1145/2784731.2784738openalex-snapshot
1ML – core and modules united (F-ing first-class modules)
inferred← citeshttps://doi.org/10.1145/2784731.2784744openalex-snapshot
Elaborating evaluation-order polymorphism
inferred← citeshttps://doi.org/10.1145/2837022openalex-snapshot
The Design and Formalization of Mezzo, a Permission-Based Programming Language
inferred← citeshttps://doi.org/10.1145/2858949.2784738openalex-snapshot
1ML – core and modules united (F-ing first-class modules)
inferred← citeshttps://doi.org/10.1145/2858949.2784744openalex-snapshot
Elaborating evaluation-order polymorphism
inferred← citeshttps://doi.org/10.1145/286936.286957openalex-snapshot
Making the future safe for the past
inferred← citeshttps://doi.org/10.1145/286942.286957openalex-snapshot
Making the future safe for the past
inferred← citeshttps://doi.org/10.1145/289423.289428openalex-snapshot
Taming effects with monadic typing
inferred← citeshttps://doi.org/10.1145/289423.289429openalex-snapshot
The marriage of effects and monads
inferred← citeshttps://doi.org/10.1145/291251.289428openalex-snapshot
Taming effects with monadic typing
inferred← citeshttps://doi.org/10.1145/291251.289429openalex-snapshot
The marriage of effects and monads
inferred← citeshttps://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferred← citeshttps://doi.org/10.1145/292540.292565openalex-snapshot
Type-based analysis of uncaught exceptions
inferred← citeshttps://doi.org/10.1145/2933575.2934509openalex-snapshot
Trace semantics for polymorphic references
inferred← citeshttps://doi.org/10.1145/301618.301665openalex-snapshot
A theory of type qualifiers
inferred← citeshttps://doi.org/10.1145/301631.301665openalex-snapshot
A theory of type qualifiers
inferred← citeshttps://doi.org/10.1145/3110283openalex-snapshot
Theorems for free for free: parametricity, with and without types
inferred← citeshttps://doi.org/10.1145/316686.316703openalex-snapshot
Componential set-based analysis
inferred← citeshttps://doi.org/10.1145/317636.317777openalex-snapshot
Monadic encapsulation in ML
inferred← citeshttps://doi.org/10.1145/317636.317796openalex-snapshot
Type inference with rank 1 polymorphism for type-directed compilation of ML
inferred← citeshttps://doi.org/10.1145/317765.317777openalex-snapshot
Monadic encapsulation in ML
inferred← citeshttps://doi.org/10.1145/317765.317796openalex-snapshot
Type inference with rank 1 polymorphism for type-directed compilation of ML
inferred← citeshttps://doi.org/10.1145/3230625openalex-snapshot
A Classical Sequent Calculus with Dependent Types
inferred← citeshttps://doi.org/10.1145/3290331openalex-snapshot
Dynamic type inference for gradual Hindley–Milner typing
inferred← citeshttps://doi.org/10.1145/3342713openalex-snapshot
Lambda: the ultimate sublanguage (experience report)
inferred← citeshttps://doi.org/10.1145/3371126openalex-snapshot
The fire triangle: how to mix substitution, dependent elimination, and effects
inferred← citeshttps://doi.org/10.1145/3386336openalex-snapshot
The history of Standard ML
inferred← citeshttps://doi.org/10.1145/3408981openalex-snapshot
Effect handlers, evidently
inferred← citeshttps://doi.org/10.1145/3408999openalex-snapshot
Signature restriction for polymorphic algebraic effects
inferred← citeshttps://doi.org/10.1145/3428222openalex-snapshot
Polymorphic types and effects with Boolean unification
inferred← citeshttps://doi.org/10.1145/3437992.3439914openalex-snapshot
Machine-checked semantic session typing
inferred← citeshttps://doi.org/10.1145/3479394.3479406openalex-snapshot
A Typed Slicing Compilation of the Polymorphic RPC calculus
inferred← citeshttps://doi.org/10.1145/349214.349230openalex-snapshot
Type-based analysis of uncaught exceptions
inferred← citeshttps://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferred← citeshttps://doi.org/10.1145/3539657openalex-snapshot
Two Parametricities Versus Three Universal Types
inferred← citeshttps://doi.org/10.1145/3546189.3549923openalex-snapshot
Partial type constructors in practice
inferred← citeshttps://doi.org/10.1145/3547642openalex-snapshot
Constraint-based type inference for FreezeML
inferred← citeshttps://doi.org/10.1145/357766.351259openalex-snapshot
Intersection types and computational effects
inferred← citeshttps://doi.org/10.1145/3591260openalex-snapshot
Better Defunctionalization through Lambda Set Specialization
inferred← citeshttps://doi.org/10.1145/3607846openalex-snapshot
With or Without You: Programming with Effect Exclusion
inferred← citeshttps://doi.org/10.1145/3610408openalex-snapshot
Focusing on Refinement Typing
inferred← citeshttps://doi.org/10.1145/3674641openalex-snapshot
Abstracting Effect Systems for Algebraic Effect Handlers
inferred← citeshttps://doi.org/10.1145/3674642openalex-snapshot
Oxidizing OCaml with Modal Memory Management
inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot
A Logical Approach to Type Soundness
inferred← citeshttps://doi.org/10.1145/3689712openalex-snapshot
A Dependent Nominal Physical Type System for Static Analysis of Memory in Low Level Code
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/3704841openalex-snapshot
Affect: An Affine Type and Effect System
inferred← citeshttps://doi.org/10.1145/3759164.3759347openalex-snapshot
Plinth: A Plugin-Powered Language Built on Haskell (Experience Report)
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/3776644openalex-snapshot
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
inferred← citeshttps://doi.org/10.1145/3776674openalex-snapshot
Rows and Capabilities as Modal Effects
inferred← citeshttps://doi.org/10.1145/3798220openalex-snapshot
Type Inference for Functional and Imperative Dynamic Languages
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.1145/503272.503302openalex-snapshot
Information flow inference for ML
inferred← citeshttps://doi.org/10.1145/565816.503302openalex-snapshot
Information flow inference for ML
inferred← citeshttps://doi.org/10.1145/581690.581693openalex-snapshot
A recursive do for Haskell
inferred← citeshttps://doi.org/10.1145/596980.596983openalex-snapshot
Information flow inference for ML
inferred← citeshttps://doi.org/10.1145/601775.601776openalex-snapshot
The marriage of effects and monads
inferred← citeshttps://doi.org/10.1145/944705.944709openalex-snapshot
ML F
inferred← citeshttps://doi.org/10.1145/944705.944730openalex-snapshot
Meta-programming through typeful code representation
inferred← citeshttps://doi.org/10.1145/944746.944709openalex-snapshot
ML F
inferred← citeshttps://doi.org/10.1145/944746.944730openalex-snapshot
Meta-programming through typeful code representation
inferred← citeshttps://doi.org/10.1145/964001.964026openalex-snapshot
A type system for well-founded recursion
inferred← citeshttps://doi.org/10.1145/982962.964026openalex-snapshot
A type system for well-founded recursion
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.21openalex-snapshot
Subject Reduction vs Intersection / Union Types in λμμ
inferred← citeshttps://doi.org/10.15760/etd.1010openalex-snapshot
Type Classes and Instance Chains: A Relational Approach
inferred← citeshttps://doi.org/10.18745/th.16354openalex-snapshot
Adaptive Constraint Solving for Information Flow Analysis
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.22028/d291-25773openalex-snapshot
A concurrent lambda-calculus with promises and futures
inferred← citeshttps://doi.org/10.3166/tsi.27.1097-1128openalex-snapshot
ReactiveML, un langage fonctionnel pour la programmation réactive
inferred← citeshttps://doi.org/10.3233/fi-2012-770openalex-snapshot
Completeness and Soundness Results for 𝒳 with Intersection and Union Types
inferred← citeshttps://doi.org/10.4204/eptcs.241.1openalex-snapshot
Generating Code with Polymorphic let: A Ballad of Value Restriction, Copying and Sharing
inferred← citeshttps://doi.org/10.4204/eptcs.378.1openalex-snapshot
Kind Inference for the FreeST Programming Language
inferred← citeshttps://doi.org/10.4204/eptcs.45.3openalex-snapshot
Sound and Complete Typing for lambda-mu
inferred← citeshttps://doi.org/10.4230/lipics.types.2017.5openalex-snapshot
Formalized Proof Systems for Propositional Logic
inferred← citeshttps://doi.org/10.4230/lipics.types.2023.2openalex-snapshot
Finite Combinatory Logic with Predicates
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4570openalex-snapshot
Reduction in X does not agree with Intersection and Union Types (Extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.1602.08406openalex-snapshot
Trace semantics for polymorphic references
inferred← citeshttps://doi.org/10.70675/6c7d13dbz7a85z4acazb45dzfbc09580d4e0openalex-snapshot
Vérification des résultats de l'inférence de types du langage OCaml
inferred← citeshttps://doi.org/10.7287/peerj-cs.22v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Sharing analysis in the Pawns compiler (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.22v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Sharing analysis in the Pawns compiler (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.22v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Sharing analysis in the Pawns compiler (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.22v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Sharing analysis in the Pawns compiler (v0.2)"
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0019openalex-snapshot
A Type-Theoretic Interpretation of Standard ML
inferred← citeshttps://doi.org/10.7717/peerj-cs.22openalex-snapshot
Sharing analysis in the Pawns compiler
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.