On the public citation graph

Structural recursive definitions in type theory

https://doi.org/10.1007/bfb0055070
0 signed · 76 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-60579-7_2openalex-snapshot
A short and flexible proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferredcites →https://doi.org/10.1007/bfb0053541openalex-snapshot
Analysis of a guard condition in type theory
inferredcites →https://doi.org/10.1016/0167-6423(89)90041-5openalex-snapshot
Introduction to functional programming
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/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferredcites →https://doi.org/10.1145/232627.232651openalex-snapshot
Synchronous Kahn networks

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/11538363_11openalex-snapshot
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
inferred← citeshttps://doi.org/10.1007/11617990_12openalex-snapshot
A Few Constructions on Constructors
inferred← citeshttps://doi.org/10.1007/11783596_4openalex-snapshot
Towards Generic Programming with Sized Types
inferred← citeshttps://doi.org/10.1007/11874683_5openalex-snapshot
Semi-continuous Sized Types and Termination
inferred← citeshttps://doi.org/10.1007/11916277_18openalex-snapshot
CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_4openalex-snapshot
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_9openalex-snapshot
A Unifying Approach to Recursive and Co-recursive Definitions
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_6openalex-snapshot
Implementation Techniques for Inductive Types in Plastic
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-45309-1_16openalex-snapshot
Modular Causality in a Synchronous Stream Language
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_1openalex-snapshot
An Introduction to Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_2openalex-snapshot
Constructor Subtyping in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_8openalex-snapshot
Constructor Subtyping
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_24openalex-snapshot
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_11openalex-snapshot
A Metalanguage for Guarded Iteration
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_28openalex-snapshot
Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_2openalex-snapshot
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_6openalex-snapshot
Towards Rewriting in Coq
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_3openalex-snapshot
Strong Normalization and Equi-(Co)Inductive Types
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_26openalex-snapshot
Building Decision Procedures in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-03153-3_3openalex-snapshot
A Tutorial on Type-Based Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_26openalex-snapshot
Trace-Based Coinductive Operational Semantics for While
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_40openalex-snapshot
Coq Modulo Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_24openalex-snapshot
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
inferred← citeshttps://doi.org/10.1007/978-3-662-45917-1_11openalex-snapshot
Corecursion and Non-divergence in Session-Typed Processes
inferred← citeshttps://doi.org/10.1007/s10990-008-9038-0openalex-snapshot
Adapting functional programs to higher order logic
inferred← citeshttps://doi.org/10.1007/s12046-009-0003-3openalex-snapshot
A compact kernel for the calculus of inductive constructions
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.034openalex-snapshot
Recursive Coalgebras from Comonads
inferred← citeshttps://doi.org/10.1016/j.ic.2005.08.005openalex-snapshot
Recursive coalgebras from comonads
inferred← citeshttps://doi.org/10.1016/j.scico.2008.01.004openalex-snapshot
Type-based termination of generic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.045openalex-snapshot
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.005openalex-snapshot
A metalanguage for guarded iteration
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00347-9openalex-snapshot
Inductive-data-type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00355-8openalex-snapshot
Least and greatest fixed points in intuitionistic natural deduction
inferred← citeshttps://doi.org/10.1017/s0956796801004191openalex-snapshot
A predicative analysis of structural recursion
inferred← citeshttps://doi.org/10.1017/s0956796803004829openalex-snapshot
The view from the left
inferred← citeshttps://doi.org/10.1017/s0956796809007266openalex-snapshot
Implementing a normalizer using sized heterogeneous 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/s0956796822000120openalex-snapshot
Is sized typing for Coq practical?
inferred← citeshttps://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferred← citeshttps://doi.org/10.1017/s0960129508006750openalex-snapshot
iRho: an imperative rewriting calculus
inferred← citeshttps://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferred← citeshttps://doi.org/10.1093/logcom/exu026openalex-snapshot
Coalgebraic logic programming: from Semantics to Implementation
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470664openalex-snapshot
Categorical models of Linear Logic with fixed points of formulas
inferred← citeshttps://doi.org/10.1145/1013963.1013983openalex-snapshot
iRho
inferred← citeshttps://doi.org/10.1145/1292597.1292601openalex-snapshot
A coinductive monad for prop-bounded recursion
inferred← citeshttps://doi.org/10.1145/2364527.2364550openalex-snapshot
Pure type systems with corecursion on streams
inferred← citeshttps://doi.org/10.1145/3158131openalex-snapshot
Up-to techniques using sized types
inferred← citeshttps://doi.org/10.1145/3360557openalex-snapshot
Refinement kinds: type-safe programming with practical type-level computation
inferred← citeshttps://doi.org/10.1145/3406089.3409029openalex-snapshot
Strongly bounded termination with applications to security and hardware synthesis
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.3233/fi-2017-1473openalex-snapshot
CoCaml: Functional Programming with Regular Coinductive Types
inferred← citeshttps://doi.org/10.34961/5391openalex-snapshot
Supercompilation and normalisation by evaluation
inferred← citeshttps://doi.org/10.34961/704openalex-snapshot
Development of the productive forces
inferred← citeshttps://doi.org/10.4204/eptcs.337.2openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
inferred← citeshttps://doi.org/10.4204/eptcs.73.7openalex-snapshot
A coinductive semantics of the Unlimited Register Machine
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.1903.07371openalex-snapshot
Coinductive Uniform Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610068openalex-snapshot
Type theory and rewriting
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1695openalex-snapshot
Sets in Coq, Coq in Sets
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/3754openalex-snapshot
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages
inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot
Size-based termination : semantics and generalizations
inferred← citeshttps://doi.org/10.70675/c1efe9f4z1500z4e67zaad4zcb5531cce150openalex-snapshot
Continuité en théorie des types
inferred← citeshttps://doi.org/10.70675/f3c96514z4373z4f99z8b3fzb1b41307d558openalex-snapshot
Formalisation et Méta-Théorie de la Théorie des Types
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.