On the public citation graph

MiniAgda: Integrating Sized and Dependent Types

https://doi.org/10.4204/eptcs.43.2

0 signed · 61 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/11538363_11openalex-snapshot

Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations

inferredcites →https://doi.org/10.1007/11874683_5openalex-snapshot

Semi-continuous Sized Types and Termination

inferredcites →https://doi.org/10.1007/11916277_18openalex-snapshot

CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions

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-60579-7_3openalex-snapshot

Codifying guarded definitions with recursive schemes

inferredcites →https://doi.org/10.1007/978-3-540-24849-1_8openalex-snapshot

Inductive Families Need Not Store Their Indices

inferredcites →https://doi.org/10.1007/978-3-540-25979-4_2openalex-snapshot

A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems

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

Foundations of Software Science and Computational Structures

inferredcites →https://doi.org/10.1007/978-3-540-78499-9_25openalex-snapshot

Erasure and Polymorphism in Pure Type Systems

inferredcites →https://doi.org/10.1007/978-3-540-78499-9_26openalex-snapshot

The Implicit Calculus of Constructions as a Programming Language with Dependent Types

inferredcites →https://doi.org/10.1007/978-3-642-02444-3_14openalex-snapshot

Using Structural Recursion for Corecursion

inferredcites →https://doi.org/10.1016/j.scico.2008.01.004openalex-snapshot

Type-based termination of generic programs

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

A predicative analysis of structural recursion

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

The view from the left

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

Type-based termination of recursive definitions

inferredcites →https://doi.org/10.1023/a:1019916231463openalex-snapshot

Dependent Types for Program Termination Verification

inferredcites →https://doi.org/10.1109/lics.2001.932500openalex-snapshot

Dependent types for program termination verification

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

Proving the correctness of reactive systems using sized types

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

The size-change principle for program termination

inferredcites →https://doi.org/10.15760/etd.2669openalex-snapshot

Irrelevance, Polymorphism, and Erasure in Type Theory

inferredcites →https://doi.org/10.2168/lmcs-4(2:3)2008openalex-snapshot

Semi-continuous Sized Types and Termination

inferredcites →https://doi.org/10.4204/eptcs.43.3openalex-snapshot

Beating the Productivity Checker Using Embedded Languages

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_18openalex-snapshot

Deep Induction: Induction Rules for (Truly) Nested Types

inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_27openalex-snapshot

Co-induction Simply

inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_11openalex-snapshot

Linear Sized Types in the Calculus of Constructions

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

Friends with Benefits

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

2-Dimensional Directed Type Theory

inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.05.001openalex-snapshot

Flag-based big-step semantics

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/s0956796818000072openalex-snapshot

Size-based termination of higher-order rewriting

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

POPLMark reloaded: Mechanizing proofs by logical relations

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

A type- and scope-safe universe of syntaxes with binding: their semantics and proofs

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

Is sized typing for Coq practical?

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

Monotone recursive types and recursive data representations in Cedille

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

Type-Based Productivity of Stream Definitions in the Calculus of Constructions

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

A typed store-passing translation for general references

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

Proving the unique fixed-point principle correct

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

Proving the unique fixed-point principle correct

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

Operational semantics using the partiality monad

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

Generic datatypes à la carte

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

Synchronous digital circuits as functional programs

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

Wellfounded recursion with copatterns

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

Foundational extensible corecursion: a proof assistant perspective

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

Foundational extensible corecursion: a proof assistant perspective

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

Unifiers as equivalences: proof-relevant unification of dependently typed data

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

A type and scope safe universe of syntaxes with binding: their semantics and proofs

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

Polymorphic Iterable Sequential Effect Systems

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

Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell

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

Citrus: Algebraic Reasoning about Superconductor Electronics

inferred← citeshttps://doi.org/10.1184/r1/6587159openalex-snapshot

2-Dimensional Directed Dependent Type Theory

inferred← citeshttps://doi.org/10.25911/5d78d9f7865dbopenalex-snapshot

Arrows for knowledge-based circuits

inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d6bopenalex-snapshot

Deep Induction: Induction Rules for (Truly) Nested Types

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

A Formal Comparison of Approaches to Datatype-Generic Programming

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.4230/lipics.icalp.2021.125openalex-snapshot

Flexible Coinduction in Agda

inferred← citeshttps://doi.org/10.46298/lmcs-21(3:20)2025openalex-snapshot

The Size-Change Principle for Mixed Inductive and Coinductive types

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

Coinduction: an elementary approach

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

Course-of-Value Induction in Cedille

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

Elaborating Inductive Definitions and Course-of-Values Induction in Cedille

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

Coinductive Invertibility in Higher Categories

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.