On the public citation graph

Analysis of a guard condition in type theory

0 signed · 37 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.1007/3-540-58085-9_72openalex-snapshot

Infinite objects in type theory

inferredcites →https://doi.org/10.1007/3-540-58085-9_77openalex-snapshot

Programming with streams in Coq a case study: The Sieve of Eratosthenes

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

Data types as lattices

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

Coq and hardware verification: A case study

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

Realizability interpretation of coinductive definitions and program synthesis with streams

inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot

The calculus of constructions

inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot

The Lambda Calculus - Its Syntax and Semantics

inferredcites →https://doi.org/10.1016/s0168-0072(96)00021-8openalex-snapshot

Equational theories for inductive types

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

Constructive natural deduction and its ‘ω-set’ interpretation

inferredcites →https://doi.org/10.1093/logcom/7.2.175openalex-snapshot

Mechanizing coinduction and corecursion in higher-order logic

inferredcites →https://doi.org/10.1137/0205037openalex-snapshot

Data Types as Lattices

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

Two Complete Axiom Systems for the Algebra of Regular Events

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11417170_7openalex-snapshot

Practical Inference for Type-Based Termination in a Polymorphic Setting

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

Semi-continuous Sized Types and Termination

inferred← citeshttps://doi.org/10.1007/3-540-44404-1_12openalex-snapshot

A PVS Proof Obligation Generator for Lustre Programs

inferred← citeshttps://doi.org/10.1007/3-540-44557-9_7openalex-snapshot

A Co-inductive Approach to Real Numbers

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

Termination and Productivity Checking with Continuous Types

inferred← citeshttps://doi.org/10.1007/3-540-45699-6_1openalex-snapshot

An Introduction to Dependent Type Theory

inferred← citeshttps://doi.org/10.1007/978-3-319-40370-0_2openalex-snapshot

Compositional Coinduction with Sized Types

inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_19openalex-snapshot

Mixed Inductive/Coinductive Types and Strong Normalization

inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_15openalex-snapshot

Probabilistic Termination by Monadic Affine Sized Typing

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

Structural recursive definitions in type theory

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

Guarded induction on final coalgebras

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

A predicative analysis of structural recursion

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

Implementing a normalizer using sized heterogeneous types

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

Well-founded recursion with copatterns and sized types

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

Interactive programming in Agda – Objects and graphical user interfaces

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

Is sized typing for Coq practical?

inferred← citeshttps://doi.org/10.1051/ita:2004015openalex-snapshot

Termination checking with types

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

Normalization by evaluation for sized dependent types

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

Up-to techniques using sized types

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

Probabilistic Termination by Monadic Affine Sized Typing

inferred← citeshttps://doi.org/10.14236/ewic/msfp2006.3openalex-snapshot

Implementing a Normalizer Using Sized Heterogeneous Types

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

Semi-continuous Sized Types and Termination

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

Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types

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

Probabilistic Termination by Monadic Affine Sized Typing (Long Version)

inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot

Size-based termination : semantics and generalizations

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.