On the public citation graph
A set constructor for inductive sets in Martin-Löf's type theory
0 signed · 42 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-15648-8_5openalex-snapshot
Recursive definitions in type theory
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_2openalex-snapshot
Revised Report on the Algorithmic Language Algol 60
inferredcites →https://doi.org/10.1007/bf00265077openalex-snapshot
Revised report on the algorithmic language ALGOL 68
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1016/0167-6423(87)90002-5openalex-snapshot
Derivation of a parsing algorithm in martin-löf's theory of types
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
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-48256-3_10openalex-snapshot
Universal Algebra in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_61openalex-snapshot
On the operational interpretation of complex types
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_12openalex-snapshot
How to Reason Coinductively Informally
inferred← citeshttps://doi.org/10.1007/978-3-319-99933-3_6openalex-snapshot
Developing GUI Applications in a Verified Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_9openalex-snapshot
Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bf01995107openalex-snapshot
On systems of definitions, induction and recursion
inferred← citeshttps://doi.org/10.1007/bf02948849openalex-snapshot
Semantics of constructions (I) — The traditional approach
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90037-gopenalex-snapshot
Program development in constructive type theory
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.022openalex-snapshot
Programming interfaces and basic topology
inferred← citeshttps://doi.org/10.1016/j.cl.2013.08.002openalex-snapshot
Binary trees as a computational framework
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00145-4openalex-snapshot
Representing inductively defined sets by wellorderings in Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1017/s0305004112000394openalex-snapshot
Polynomial functors and polynomial monads
inferred← citeshttps://doi.org/10.1017/s0956796808006898openalex-snapshot
A pattern for almost compositional functions
inferred← citeshttps://doi.org/10.1017/s0956796816000319openalex-snapshot
Interactive programming in Agda – Objects and graphical user interfaces
inferred← citeshttps://doi.org/10.1017/s0960129509007440openalex-snapshot
Three extensional models of type theory
inferred← citeshttps://doi.org/10.1017/s0960129514000516openalex-snapshot
W-types in homotopy type theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0007openalex-snapshot
INTERACTIVE PROGRAMS AND WEAKLY FINAL COALGEBRAS IN DEPENDENT TYPE THEORY
inferred← citeshttps://doi.org/10.1109/lics.2012.21openalex-snapshot
Inductive Types in Homotopy Type Theory
inferred← citeshttps://doi.org/10.1109/lics.2013.60openalex-snapshot
A Categorical Treatment of Ornaments
inferred← citeshttps://doi.org/10.1145/1159803.1159834openalex-snapshot
A pattern for almost compositional functions
inferred← citeshttps://doi.org/10.1145/3006383openalex-snapshot
Homotopy-Initial Algebras in Type Theory
inferred← citeshttps://doi.org/10.2168/lmcs-10(2:2)2014openalex-snapshot
A Linear Category of Polynomial Functors (extensional part)
inferred← citeshttps://doi.org/10.4230/dagsemproc.04381.2openalex-snapshot
Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory (Extended Version)
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.56openalex-snapshot
A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma
inferred← citeshttps://doi.org/10.46298/entics.11755openalex-snapshot
A topological counterpart of well-founded trees in dependent type theory
inferred← citeshttps://doi.org/10.48550/arxiv.0905.4063openalex-snapshot
Programming interfaces and basic topology
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3898openalex-snapshot
Inductive types in homotopy type theory
inferred← citeshttps://doi.org/10.48730/zt52-kb39openalex-snapshot
A cosmology of datatypes : reusability and dependent types
inferred← citeshttps://doi.org/10.5555/2591370.2591396openalex-snapshot
A Categorical Treatment of Ornaments
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.