On the public citation graph
Inductively defined types in the Calculus of Constructions
0 signed · 105 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-15198-2_7openalex-snapshot
Three approaches to type structure
inferredcites →https://doi.org/10.1007/3-540-15648-8_18openalex-snapshot
Second-order logical relations
inferredcites →https://doi.org/10.1007/3-540-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-52753-2_47openalex-snapshot
On the representation of data in lambda-calculus
inferredcites →https://doi.org/10.1007/bf00245294openalex-snapshot
Using typed lambda calculus to implement formal systems on a machine
inferredcites →https://doi.org/10.1007/bfb0035757openalex-snapshot
Polymorphic rewriting conserves algebraic strong normalization and confluence
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)90109-uopenalex-snapshot
Metacircularity in the polymorphic λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90039-5openalex-snapshot
About primitive recursive algorithms
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/s0049-237x(08)70843-7openalex-snapshot
Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7040-5openalex-snapshot
Proceedings of the Second Scandinavian Logic Symposium
inferredcites →https://doi.org/10.1109/sfcs.1983.50openalex-snapshot
Reasoning about functional programs and complexity classes associated with type disciplines
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/322358.322370openalex-snapshot
The Expressiveness of Simple and Second-Order Type Structures
inferredcites →https://doi.org/10.1145/75277.75285openalex-snapshot
Extracting ω's programs from proofs in the calculus of constructions
inferredcites →https://doi.org/10.1184/r1/6607238openalex-snapshot
Metacircularity in the polymorphic [lambda]-calculus
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.9999openalex-snapshot
A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_1openalex-snapshot
Fix-Point Equations for Well-Founded Recursion in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_5openalex-snapshot
Recursive Families of Inductive 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-45699-6_1openalex-snapshot
An Introduction to Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_3openalex-snapshot
Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_46openalex-snapshot
LEAP: A language with eval and polymorphism
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_40openalex-snapshot
Monotone recursive definition of predicates and its realizability interpretation
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_20openalex-snapshot
Synthesizing proofs from programs in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_82openalex-snapshot
Expressing computational complexity in constructive type theory
inferred← citeshttps://doi.org/10.1007/978-3-030-75267-5_3openalex-snapshot
On the Conciliation of Traditional and Computer-Assisted Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-89391-0_25openalex-snapshot
A Henkin-Style Completeness Proof for the Modal Logic S5
inferred← citeshttps://doi.org/10.1007/978-3-031-29082-4_3openalex-snapshot
Curiously Empty Intersection of Proof Engineering and Computational Sciences
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_8openalex-snapshot
Some Remarks About Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_25openalex-snapshot
Modular Dependent Induction in Coq, Mendler-Style
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_14openalex-snapshot
Efficient Mendler-Style Lambda-Encodings in Cedille
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_47openalex-snapshot
Recursion on Nested Datatypes in Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_26openalex-snapshot
On the Representation of Imperative Programs in a Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_13openalex-snapshot
Indexed Induction and Coinduction, Fibrationally
inferred← citeshttps://doi.org/10.1007/978-3-642-27549-4_22openalex-snapshot
On the Confluence of the Graphic Calculus with Penrose Diagrams (I)
inferred← citeshttps://doi.org/10.1007/978-3-642-34407-7_11openalex-snapshot
Hardware Design with Generalized Arrows
inferred← citeshttps://doi.org/10.1007/978-3-642-46752-3_14openalex-snapshot
On Exploiting the Structure of Martin-Lof's Theory of Types
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_7openalex-snapshot
Type Theories from Barendregt’s Cube for Theorem Provers
inferred← citeshttps://doi.org/10.1007/bf01211457openalex-snapshot
Verifying programs in the calculus of inductive constructions
inferred← citeshttps://doi.org/10.1007/bf02946501openalex-snapshot
Structures definable in polymorphism
inferred← citeshttps://doi.org/10.1007/bf02948849openalex-snapshot
Semantics of constructions (I) — The traditional approach
inferred← citeshttps://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferred← citeshttps://doi.org/10.1007/bfb0040251openalex-snapshot
Mathematical Foundations of Programming Semantics
inferred← citeshttps://doi.org/10.1007/bfb0055099openalex-snapshot
The relevance of proof-irrelevance
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90109-uopenalex-snapshot
Metacircularity in the polymorphic λ-calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2018.03.002openalex-snapshot
From realizability to induction via dependent intersection
inferred← citeshttps://doi.org/10.1016/j.jal.2012.07.007openalex-snapshot
Cut elimination for a logic with induction and co-induction
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.12.004openalex-snapshot
Deciding Kleene algebra terms equivalence in Coq
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/s0956796803004957openalex-snapshot
First-order unification by structural recursion
inferred← citeshttps://doi.org/10.1017/s0956796820000155openalex-snapshot
Leibniz equality is isomorphic to Martin-Löf identity, parametrically
inferred← citeshttps://doi.org/10.1017/s0960129500000372openalex-snapshot
Categorical data types in parametric polymorphism
inferred← citeshttps://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferred← citeshttps://doi.org/10.1017/s0960129505004822openalex-snapshot
Modelling general recursion in type theory
inferred← citeshttps://doi.org/10.1017/s096012959900300xopenalex-snapshot
On lists and other abstract data types in the calculus of constructions
inferred← citeshttps://doi.org/10.1023/a:1006285817788openalex-snapshot
Certification of a Type Inference Tool for ML: Damas–Milner within Coq
inferred← citeshttps://doi.org/10.1093/logcom/exu031openalex-snapshot
The formal strong completeness of partial monoidal Boolean BI
inferred← citeshttps://doi.org/10.1109/ase.2017.8115630openalex-snapshot
ICoq: Regression proof selection for large-scale verification projects
inferred← citeshttps://doi.org/10.1109/lics.1995.523262openalex-snapshot
Experience using type theory as a foundation for computer science
inferred← citeshttps://doi.org/10.1109/lics.2012.25openalex-snapshot
A Computational Interpretation of Parametricity
inferred← citeshttps://doi.org/10.1109/tase.2009.17openalex-snapshot
The Logical Approach to Low-Level Stack Reasoning
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3536803openalex-snapshot
Secure Optimizations on Ethereum Bytecode Jump-Free Sequences
inferred← citeshttps://doi.org/10.1109/trustcom.2015.647openalex-snapshot
A Formal Perspective on IEC 61499 Execution Control Chart Semantics
inferred← citeshttps://doi.org/10.1145/1328438.1328475openalex-snapshot
Foundations for structured programming with GADTs
inferred← citeshttps://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferred← citeshttps://doi.org/10.1145/3167087openalex-snapshot
Generic derivation of induction for impredicative encodings in Cedille
inferred← citeshttps://doi.org/10.1145/3213846.3213877openalex-snapshot
piCoq: parallel regression proving for large-scale verification projects
inferred← citeshttps://doi.org/10.1145/3372885.3373824openalex-snapshot
The lean mathematical library
inferred← citeshttps://doi.org/10.1145/351240.351248openalex-snapshot
Fully reflexive intensional type analysis
inferred← citeshttps://doi.org/10.1145/357766.351248openalex-snapshot
Fully reflexive intensional type analysis
inferred← citeshttps://doi.org/10.1145/581478.581501openalex-snapshot
A compiled implementation of strong reduction
inferred← citeshttps://doi.org/10.1145/641888.641889openalex-snapshot
Intensional analysis of quantified types
inferred← citeshttps://doi.org/10.1184/r1/6608669openalex-snapshot
Programming in higher-order typed lambda-calculi
inferred← citeshttps://doi.org/10.1184/r1/6608684openalex-snapshot
Programming with intersection types, union types, and polymorphism
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.21236/ada249562openalex-snapshot
Programming with Inductive and Co-Inductive Types
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:6)2013openalex-snapshot
Indexed Induction and Coinduction, Fibrationally
inferred← citeshttps://doi.org/10.22028/d291-26373openalex-snapshot
Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis
inferred← citeshttps://doi.org/10.3233/fi-1996-26202openalex-snapshot
RECURSIVE MODELS OF GENERAL INDUCTIVE TYPES
inferred← citeshttps://doi.org/10.4204/eptcsopenalex-snapshot
Electronic Proceedings in Theoretical Computer Science
inferred← citeshttps://doi.org/10.4204/eptcs.191.13openalex-snapshot
Reasoning about modular datatypes with Mendler induction
inferred← citeshttps://doi.org/10.4204/eptcs.307.6openalex-snapshot
A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille
inferred← citeshttps://doi.org/10.4204/eptcs.336openalex-snapshot
Proceedings Seventh Workshop on Proof eXchange for Theorem Proving
inferred← citeshttps://doi.org/10.4204/eptcs.336.2openalex-snapshot
A Framework for Proof-carrying Logical Transformations
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.48550/arxiv.1509.03021openalex-snapshot
Reasoning about modular datatypes with Mendler induction
inferred← citeshttps://doi.org/10.48550/arxiv.2012.09388openalex-snapshot
Formalization of PAL$\cdot$S5 in Proof Assistant
inferred← citeshttps://doi.org/10.70675/0fbba6fbz729az49fdzbf9azfc9f951aa0b0openalex-snapshot
Extraction de code fonctionnel certifié à partir de spécifications inductives
inferred← citeshttps://doi.org/10.70675/4ed9549cz5e00z4f05zba82z2d01e07a6985openalex-snapshot
Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory using Rewriting
inferred← citeshttps://doi.org/10.70675/7f5a49e7z0717z4fb9zb637z67b60612438copenalex-snapshot
Formalisations d’analyses d’erreurs en analyse numérique et en arithmétique à virgule flottante
inferred← citeshttps://doi.org/10.70675/e161fb97z1fe2z4e3ez926dzfbaa8dbfdd17openalex-snapshot
Combining union, intersection and dependent types in an explicitely typed lambda-calculus
inferred← citeshttps://doi.org/10.70675/f98d24a2z5c12z4e55z9beaz640d83f7b9bdopenalex-snapshot
A formalization of elliptic curves for cryptography
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.