On the public citation graph

A logic for parametric polymorphism

0 signed · 175 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.1993.1037openalex-snapshot

On Functors Expressible in the Polymorphic Typed Lambda Calculus

inferredcites →https://doi.org/10.1006/inco.1994.1013openalex-snapshot

An Extension of System F with Subtyping

inferredcites →https://doi.org/10.1007/3-540-18508-9openalex-snapshot

Category Theory and Computer Science

inferredcites →https://doi.org/10.1007/3-540-18508-9_18openalex-snapshot

Polymorphism is set theoretic, constructively

inferredcites →https://doi.org/10.1007/3-540-54415-1_61openalex-snapshot

Parametricity of extensionally collapsed term models of polymorphism and their categorical properties

inferredcites →https://doi.org/10.1007/3-540-54415-1_72openalex-snapshot

Subtyping + extensionality: Confluence of βηtop reduction in F≤

inferredcites →https://doi.org/10.1007/3-540-54415-1_73openalex-snapshot

An extension of system F with subtyping

inferredcites →https://doi.org/10.1007/3-540-55511-0_1openalex-snapshot

Types, abstraction, and parametric polymorphism, part 2

inferredcites →https://doi.org/10.1007/3-540-57887-0openalex-snapshot

Theoretical Aspects of Computer Software

inferredcites →https://doi.org/10.1007/3540543961_15openalex-snapshot

Outline of a proof theory of parametricity

inferredcites →https://doi.org/10.1007/978-3-642-93220-5_3openalex-snapshot

Information Processing

inferredcites →https://doi.org/10.1007/bfb0018348openalex-snapshot

A note on categorical datatypes

inferredcites →https://doi.org/10.1016/0304-3975(85)90135-5openalex-snapshot

Automatic synthesis of typed Λ-programs on term algebras

inferredcites →https://doi.org/10.1016/0304-3975(90)90151-7openalex-snapshot

Functorial polymorphism

inferredcites →https://doi.org/10.1016/0304-3975(94)90014-0openalex-snapshot

A co-induction principle for recursively defined domains

inferredcites →https://doi.org/10.1016/b978-0-12-450010-5.50023-2openalex-snapshot

On the Equivalence of Data Representations

inferredcites →https://doi.org/10.1017/cbo9780511525902openalex-snapshot

Applications of Categories in Computer Science

inferredcites →https://doi.org/10.1017/cbo9780511525902.016openalex-snapshot

I-categories and duality

inferredcites →https://doi.org/10.1017/s0960129500000372openalex-snapshot

Categorical data types in parametric polymorphism

inferredcites →https://doi.org/10.1017/s0960129500001134openalex-snapshot

Coherence of subsumption, minimum typing and type-checking in F ≤

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1142/9789812812636_0008openalex-snapshot

INFORMATION PROCESSING

inferredcites →https://doi.org/10.1145/158511.158622openalex-snapshot

Formal parametric polymorphism

inferredcites →https://doi.org/10.1145/318593.318606openalex-snapshot

Abstract types have existential types

inferredcites →https://doi.org/10.1145/319838.319872openalex-snapshot

A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1998.2725openalex-snapshot

Structural Induction and Coinduction in a Fibrational Setting

inferred← citeshttps://doi.org/10.1006/inco.2001.2927openalex-snapshot

Objects and Classes in Algol-Like Languages

inferred← citeshttps://doi.org/10.1007/10703163_23openalex-snapshot

Logical Relations and Inductive/Coinductive Types

inferred← citeshttps://doi.org/10.1007/11787006_32openalex-snapshot

Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism

inferred← citeshttps://doi.org/10.1007/11874683_12openalex-snapshot

Abstracting Allocation

inferred← citeshttps://doi.org/10.1007/3-540-36576-1_1openalex-snapshot

A Game Semantics for Generic Polymorphism

inferred← citeshttps://doi.org/10.1007/3-540-44904-3_10openalex-snapshot

Abstraction Barrier-Observing Relational Parametricity

inferred← citeshttps://doi.org/10.1007/3-540-45061-0_70openalex-snapshot

Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types

inferred← citeshttps://doi.org/10.1007/3-540-45309-1_7openalex-snapshot

Encoding Intensional Type Analysis

inferred← citeshttps://doi.org/10.1007/3-540-45500-0_24openalex-snapshot

The Girard-Reynolds Isomorphism

inferred← citeshttps://doi.org/10.1007/3-540-45694-5_15openalex-snapshot

A Spatial Logic for Concurrency (Part II)

inferred← citeshttps://doi.org/10.1007/3-540-45719-4_1openalex-snapshot

From Specifications to Code in Casl

inferred← citeshttps://doi.org/10.1007/3-540-46432-8_9openalex-snapshot

A Higher-Order Simulation Relation for System F

inferred← citeshttps://doi.org/10.1007/3-540-47797-7_7openalex-snapshot

Exercises in Coalgebraic Specification

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_32openalex-snapshot

Monadic Presentations of Lambda Terms Using Generalized Inductive Types

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_37openalex-snapshot

Specification Refinement with System F

inferred← citeshttps://doi.org/10.1007/3-540-48959-2_22openalex-snapshot

A Logic for Abstract Data Types as Existential Types

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_8openalex-snapshot

Observable properties of higher order functions that dynamically create local names, or: What's new?

inferred← citeshttps://doi.org/10.1007/3-540-61377-3_44openalex-snapshot

A logical aspect of parametric polymorphism

inferred← citeshttps://doi.org/10.1007/3-540-62688-3_46openalex-snapshot

An axiomatic system of parametricity

inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_7openalex-snapshot

Polymorphic Session Processes as Morphisms

inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_6openalex-snapshot

A Formal Logic for Formal Category Theory

inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_23openalex-snapshot

Call-by-Value in a Basic Logic for Interaction

inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_2openalex-snapshot

A Trace Semantics for System F Parametric Polymorphism

inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_29openalex-snapshot

On Polymorphic Sessions and Functions

inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_8openalex-snapshot

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus

inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_10openalex-snapshot

Specification Refinement with System F – The Higher-Order Case

inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_4openalex-snapshot

Semantic and Syntactic Approaches to Simulation Relations

inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_10openalex-snapshot

A Logic for Parametric Polymorphism with Effects

inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_8openalex-snapshot

Unfolding Abstract Datatypes

inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_8openalex-snapshot

Relational Parametricity and Separation Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_25openalex-snapshot

Erasure and Polymorphism in Pure Type Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-89330-1_9openalex-snapshot

Extensional Universal Types for Call-by-Value

inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_19openalex-snapshot

Abstraction for Concurrent Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_8openalex-snapshot

Realizability and Parametricity in Pure Type Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_21openalex-snapshot

Adding Equations to System F Types

inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_1openalex-snapshot

Comprehensive Parametric Polymorphism: Categorical Models and Type Theory

inferred← citeshttps://doi.org/10.1007/bf01806033openalex-snapshot

Categorical models for local names

inferred← citeshttps://doi.org/10.1007/bfb0014043openalex-snapshot

A model for formal parametric polymorphism: A per interpretation for system R

inferred← citeshttps://doi.org/10.1007/bfb0014552openalex-snapshot

An axiomatic approach to binary logical relations with applications to data refinement

inferred← citeshttps://doi.org/10.1007/bfb0055063openalex-snapshot

Existential types: Logical relations and operational equivalence

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90093-9openalex-snapshot

The genericity theorem and parametricity in the polymorphic λ-calculus

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00126-4openalex-snapshot

Parametricity as isomorphism

inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.002openalex-snapshot

A game semantics for generic polymorphism

inferred← citeshttps://doi.org/10.1016/j.apal.2008.03.006openalex-snapshot

Synthetic domain theory and models of linear Abadi & Plotkin logic

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.057openalex-snapshot

Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.058openalex-snapshot

Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.010openalex-snapshot

Syntactic Logical Relations for Polymorphic and Recursive Types

inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.020openalex-snapshot

Automata-Theoretic Semantics of Idealized Algol with Passive Expressions

inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.008openalex-snapshot

Logical Relations and Parametricity – A Reynolds Programme for Category Theory and Programming Languages

inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.011openalex-snapshot

Bifibrational Functorial Semantics of Parametric Polymorphism

inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.013openalex-snapshot

Deriving Logical Relations from Interpretations of Predicate Logic

inferred← citeshttps://doi.org/10.1016/j.jpaa.2021.106689openalex-snapshot

Composing dinatural transformations: Towards a calculus of substitution

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.031openalex-snapshot

Polynat in PER models

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.025openalex-snapshot

A fibrational framework for possible-world semantics of Algol-like languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.042openalex-snapshot

The Girard–Reynolds isomorphism (second edition)

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.016openalex-snapshot

Domain-theoretical models of parametric polymorphism

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.021openalex-snapshot

Abstraction for concurrent objects

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.003openalex-snapshot

An observationally complete program logic for imperative higher-order functions

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00141-xopenalex-snapshot

The Girard–Reynolds isomorphism

inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot

Some aspects of categories in computer science

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80915-0openalex-snapshot

From Algebras and Coalgebras to Dialgebras

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80685-1openalex-snapshot

Parametric Polymorphism and Operational Equivalence (Preliminary Version)

inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot

Lambda-Calculus and Combinators in the 20th Century

inferred← citeshttps://doi.org/10.1017/s0956796800001246openalex-snapshot

Strong normalisation for the linear term calculus

inferred← citeshttps://doi.org/10.1017/s095679680800693xopenalex-snapshot

Algebraic fusion of functions with an accumulating parameter and its improvement

inferred← citeshttps://doi.org/10.1017/s0956796810000079openalex-snapshot

Parametricity, type equality, and higher-order polymorphism

inferred← citeshttps://doi.org/10.1017/s0956796812000056openalex-snapshot

Proofs for free

inferred← citeshttps://doi.org/10.1017/s0956796819000145openalex-snapshot

A relational logic for higher-order programs

inferred← citeshttps://doi.org/10.1017/s0956796820000192openalex-snapshot

Faster coroutine pipelines: A reconstruction

inferred← citeshttps://doi.org/10.1017/s0960129500003054openalex-snapshot

[top ][top ]-closed relations and admissibility

inferred← citeshttps://doi.org/10.1017/s0960129500003066openalex-snapshot

Parametric polymorphism and operational equivalence

inferred← citeshttps://doi.org/10.1017/s0960129502003778openalex-snapshot

βη-complete models for System F

inferred← citeshttps://doi.org/10.1017/s0960129504004578openalex-snapshot

On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi

inferred← citeshttps://doi.org/10.1017/s0960129505004834openalex-snapshot

Categorical models for Abadi and Plotkin's logic for parametricity

inferred← citeshttps://doi.org/10.1017/s0960129508006828openalex-snapshot

Curry-style type isomorphisms and game semantics

inferred← citeshttps://doi.org/10.1017/s096012950900766xopenalex-snapshot

From parametric polymorphism to models of polymorphic FPC

inferred← citeshttps://doi.org/10.1017/s0960129518000336openalex-snapshot

Universal properties for universal types in bifibrational parametricity

inferred← citeshttps://doi.org/10.1023/a:1010022312623openalex-snapshot

Abstract Models of Storage

inferred← citeshttps://doi.org/10.1093/logcom/exv091openalex-snapshot

Well-definedness and observational equivalence for inductive–coinductive programs

inferred← citeshttps://doi.org/10.1109/icse-companion52605.2021.00095openalex-snapshot

Verifying Determinism in Sequential Programs

inferred← citeshttps://doi.org/10.1109/icse43902.2021.00017openalex-snapshot

Verifying Determinism in Sequential Programs

inferred← citeshttps://doi.org/10.1109/lics.1993.287605openalex-snapshot

The genericity theorem and the notion of parametricity in the polymorphic lambda -calculus

inferred← citeshttps://doi.org/10.1109/lics.1994.316056openalex-snapshot

A semantics of object types

inferred← citeshttps://doi.org/10.1109/lics.1994.316058openalex-snapshot

Subtyping and parametricity

inferred← citeshttps://doi.org/10.1109/lics.2004.1319618openalex-snapshot

Parametric limits

inferred← citeshttps://doi.org/10.1109/lics.2005.44openalex-snapshot

Relational Parametricity and Control

inferred← citeshttps://doi.org/10.1109/lics.2007.40openalex-snapshot

Relational Parametricity for Computational Effects

inferred← citeshttps://doi.org/10.1109/lics.2009.30openalex-snapshot

Dinatural Terms in System F

inferred← citeshttps://doi.org/10.1109/lics.2009.34openalex-snapshot

Logical Step-Indexed Logical Relations

inferred← citeshttps://doi.org/10.1109/lics.2012.25openalex-snapshot

A Computational Interpretation of Parametricity

inferred← citeshttps://doi.org/10.1109/lics.2017.8005084openalex-snapshot

Fibred fibration categories

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470696openalex-snapshot

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus

inferred← citeshttps://doi.org/10.1145/1013963.1013985openalex-snapshot

A compositional logic for polymorphic higher-order functions

inferred← citeshttps://doi.org/10.1145/1016848.1016874openalex-snapshot

From process logic to program logic

inferred← citeshttps://doi.org/10.1145/1159803.1159835openalex-snapshot

Algebraic fusion of functions with an accumulating parameter and its improvement

inferred← citeshttps://doi.org/10.1145/1481861.1481873openalex-snapshot

Relational parametricity for references and recursive types

inferred← citeshttps://doi.org/10.1145/158511.158622openalex-snapshot

Formal parametric polymorphism

inferred← citeshttps://doi.org/10.1145/1596638.1596644openalex-snapshot

Unembedding domain-specific languages

inferred← citeshttps://doi.org/10.1145/1706299.1706323openalex-snapshot

A relational modal logic for higher-order stateful ADTs

inferred← citeshttps://doi.org/10.1145/1863543.1863592openalex-snapshot

Parametricity and dependent types

inferred← citeshttps://doi.org/10.1145/210346.210425openalex-snapshot

Parametricity and local variables

inferred← citeshttps://doi.org/10.1145/2491522.2491523openalex-snapshot

Dependent Type Theory for Verification of Information Flow and Access Control Policies

inferred← citeshttps://doi.org/10.1145/2500365.2500600openalex-snapshot

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

inferred← citeshttps://doi.org/10.1145/2535838.2535852openalex-snapshot

A relationally parametric model of dependent type theory

inferred← citeshttps://doi.org/10.1145/2536740.2536741openalex-snapshot

Logical relations for a logical framework

inferred← citeshttps://doi.org/10.1145/3009837.3009855openalex-snapshot

Interactive proofs in higher-order concurrent separation logic

inferred← citeshttps://doi.org/10.1145/3009837.3009877openalex-snapshot

A relational model of types-and-effects in higher-order concurrent separation logic

inferred← citeshttps://doi.org/10.1145/306198.306206openalex-snapshot

Polymorphism, objects and abstract types

inferred← citeshttps://doi.org/10.1145/3110265openalex-snapshot

A relational logic for higher-order programs

inferred← citeshttps://doi.org/10.1145/3110276openalex-snapshot

Parametric quantifiers for dependent type theory

inferred← citeshttps://doi.org/10.1145/317636.317787openalex-snapshot

A simple proof technique for certain parametricity results

inferred← citeshttps://doi.org/10.1145/3209108.3209174openalex-snapshot

ReLoC

inferred← citeshttps://doi.org/10.1145/3290328openalex-snapshot

Gradual type theory

inferred← citeshttps://doi.org/10.1145/331605.331611openalex-snapshot

From Algol to polymorphic linear lambda-calculus

inferred← citeshttps://doi.org/10.1145/3371114openalex-snapshot

Graduality and parametricity: together again for the first time

inferred← citeshttps://doi.org/10.1145/3434291openalex-snapshot

Mechanized logical relations for termination-insensitive noninterference

inferred← citeshttps://doi.org/10.1145/3457884openalex-snapshot

On Polymorphic Sessions and Functions

inferred← citeshttps://doi.org/10.1145/3474834openalex-snapshot

Logical Relations as Types: Proof-Relevant Parametricity for Program Modules

inferred← citeshttps://doi.org/10.1145/3632850openalex-snapshot

Internal and Observational Parametricity for Cubical Agda

inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot

A Logical Approach to Type Soundness

inferred← citeshttps://doi.org/10.1145/888251.888274openalex-snapshot

Generativity and dynamic opacity for abstract types

inferred← citeshttps://doi.org/10.17760/d20003058openalex-snapshot

Understanding and expressing scalable concurrency

inferred← citeshttps://doi.org/10.17760/d20398327openalex-snapshot

A semantic foundation for sound gradual typing

inferred← citeshttps://doi.org/10.17863/cam.15863openalex-snapshot

Names and higher-order functions.

inferred← citeshttps://doi.org/10.2168/lmcs-2(3:3)2006openalex-snapshot

Relational Parametricity and Control

inferred← citeshttps://doi.org/10.2168/lmcs-5(3:7)2009openalex-snapshot

Relational Parametricity for Computational Effects

inferred← citeshttps://doi.org/10.2168/lmcs-7(2:16)2011openalex-snapshot

Logical Step-Indexed Logical Relations

inferred← citeshttps://doi.org/10.2168/lmcs-8(3:22)2012openalex-snapshot

Two for the Price of One: Lifting Separation Logic Assertions

inferred← citeshttps://doi.org/10.22028/d291-25766openalex-snapshot

Generativity and dynamic opacity for abstract types (extended version)

inferred← citeshttps://doi.org/10.22028/d291-25774openalex-snapshot

Dynamic opacity for abstract types

inferred← citeshttps://doi.org/10.2307/2586659openalex-snapshot

The shuffle Hopf algebra and noncommutative full completeness

inferred← citeshttps://doi.org/10.23638/lmcs-15(4:6)2019openalex-snapshot

On completeness and parametricity in the realizability semantics of System F

inferred← citeshttps://doi.org/10.23638/lmcs-16(1:7)2020openalex-snapshot

Call-by-name Gradual Type Theory

inferred← citeshttps://doi.org/10.3233/fi-1995-22124openalex-snapshot

PARAMETRIC AND TYPE-DEPENDENT POLYMORPHISM

inferred← citeshttps://doi.org/10.3233/fi-1998-33404openalex-snapshot

An Axiomatic System of Parametricity

inferred← citeshttps://doi.org/10.4204/eptcs.292.9openalex-snapshot

Proof Nets, Coends and the Yoneda Isomorphism

inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.381openalex-snapshot

Parametricity in an Impredicative Sort

inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.46openalex-snapshot

Relational Parametricity for Higher Kinds

inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.432openalex-snapshot

Internalizing Relational Parametricity in the Extensional Calculus of Constructions

inferred← citeshttps://doi.org/10.4230/lipics.csl.2020.13openalex-snapshot

Internal Parametricity for Cubical Type Theory

inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.35openalex-snapshot

The Yoneda Reduction of Polymorphic Types

inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.27openalex-snapshot

What's Decidable about (Atomic) Polymorphism

inferred← citeshttps://doi.org/10.48550/arxiv.1707.04984openalex-snapshot

FabULous Interoperability for ML and a Linear Language

inferred← citeshttps://doi.org/10.48550/arxiv.2101.09655openalex-snapshot

Relational Type Theory (All Proofs)

inferred← citeshttps://doi.org/10.48550/arxiv.2104.13324openalex-snapshot

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.2107.06150openalex-snapshot

From Identity to Difference: A Quantitative Interpretation of the Identity Type

inferred← citeshttps://doi.org/10.5287/ora-kz1vnm9qgopenalex-snapshot

Stream fusion: practical shortcut fusion for coinductive sequence types

inferred← citeshttps://doi.org/10.70930/tac/c16x3xtfopenalex-snapshot

Category-theoretic models of Linear Abadi & Plotkin Logic

inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot

Advanced Topics in Types and Programming Languages

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.