On the public citation graph
Inductive definitions in the system Coq rules and properties
0 signed · 350 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-52753-2_47openalex-snapshot
On the representation of data in lambda-calculus
inferredcites →https://doi.org/10.1007/bfb0040259openalex-snapshot
Inductively defined types in the Calculus of Constructions
inferredcites →https://doi.org/10.1016/0167-6423(90)90058-lopenalex-snapshot
Comparing integrated and external logics of functional programs
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.1017/s0956796800020037openalex-snapshot
Modular proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1109/lics.1991.151633openalex-snapshot
Partial objects in the calculus of constructions
inferredcites →https://doi.org/10.1145/75277.75285openalex-snapshot
Extracting ω's programs from proofs in the calculus of constructions
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.2000.2902openalex-snapshot
On the Formalization of the Modal μ-Calculus in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/10721975_1openalex-snapshot
Rewriting Logic and Maude: Concepts and Applications
inferred← citeshttps://doi.org/10.1007/10930755_6openalex-snapshot
Changing Data Representation within the Coq System
inferred← citeshttps://doi.org/10.1007/11417170_21openalex-snapshot
Privacy in Data Mining Using Formal Methods
inferred← citeshttps://doi.org/10.1007/11417170_25openalex-snapshot
The $\nabla$ -Calculus. Functional Programming with Higher-Order Encodings
inferred← citeshttps://doi.org/10.1007/11417170_9openalex-snapshot
Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve
inferred← citeshttps://doi.org/10.1007/11814771_50openalex-snapshot
Consistency and Completeness of Rewriting in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/11874683_5openalex-snapshot
Semi-continuous Sized Types and Termination
inferred← citeshttps://doi.org/10.1007/11916277_1openalex-snapshot
Higher-Order Termination: From Kruskal to Computability
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_25openalex-snapshot
Building Certified Libraries for PCC: Dynamic Storage Allocation
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_27openalex-snapshot
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μCalculus
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_4openalex-snapshot
Rewriting Logic as a Metalogical Framework
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-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-44802-0_41openalex-snapshot
Recursion for Higher-Order Encodings
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_19openalex-snapshot
Observational Equivalence and Program Extraction in the Coq Proof Assistant
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_30openalex-snapshot
A Higher-Order Specification of the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_7openalex-snapshot
Encoding Intensional Type Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45410-1_17openalex-snapshot
Higher-Order Intuitionistic Formalization and Proofs in Hilbert’s Elementary Geometry
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_14openalex-snapshot
Tradeoffs in the Intensional Representation of Lambda Terms
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_18openalex-snapshot
A Type-Theoretic Approach to Induction with Higher-Order Encodings
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_34openalex-snapshot
Certifying Synchrony for Free
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_4openalex-snapshot
Efficient Reasoning about Executable Specifications in Coq
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-45842-5_12openalex-snapshot
Changing Data Structures in Type Theory: A Study of Natural Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_4openalex-snapshot
A Modal Lambda Calculus with Iteration and Case Constructs
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_7openalex-snapshot
Hardware Verification Using Co-induction in COQ
inferred← citeshttps://doi.org/10.1007/3-540-48257-1_3openalex-snapshot
Formal Program Development in Geometric Modeling
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_11openalex-snapshot
A Finite Axiomatization of Inductive-Recursive Definitions
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_22openalex-snapshot
A Logic for Abstract Data Types as Existential Types
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_108openalex-snapshot
The Gallina specification language: A case study
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_81openalex-snapshot
Developing certified programs in the system Coq the program tactic
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_11openalex-snapshot
A fixedpoint approach to implementing (Co)inductive definitions
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_36openalex-snapshot
Higher-Order Abstract Syntax with induction in Coq
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_14openalex-snapshot
Termination proofs for higher-order rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_218openalex-snapshot
Reasoning with executable specifications
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_56openalex-snapshot
Encoding natural semantics in Coq
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_19openalex-snapshot
Extracting programs with exceptions in an impredicative type system
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-60579-7_10openalex-snapshot
Formalization of a λ-calculus with explicit substitutions in Coq
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_5openalex-snapshot
A user's friendly syntax to define recursive functions as typed λ-terms
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_18openalex-snapshot
Modular properties of algebraic type systems
inferred← citeshttps://doi.org/10.1007/3-540-61780-9_64openalex-snapshot
Automating inversion of inductive predicates in Coq
inferred← citeshttps://doi.org/10.1007/3-540-61780-9_67openalex-snapshot
An application of co-inductive types in Coq: Verification of the alternating bit protocol
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_32openalex-snapshot
A module calculus for pure type systems
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_34openalex-snapshot
Primitive recursion for higher-order abstract syntax
inferred← citeshttps://doi.org/10.1007/3-540-64582-9_734openalex-snapshot
Theory of constructible domains for robotics: Why?
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-1-4471-3229-5_18openalex-snapshot
Verifying Process Algebra Proofs in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_3openalex-snapshot
Practical Proof Search for Coq by Type Inhabitation
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_6openalex-snapshot
Parametric Church’s Thesis: Synthetic Computability Without Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_7openalex-snapshot
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_22openalex-snapshot
Material Dialogues for First-Order Logic in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_3openalex-snapshot
Formal Verification of Bit-Vector Invertibility Conditions in Coq
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_12openalex-snapshot
Observational Equality Meets CIC
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_5openalex-snapshot
Programming with Dependent Additive Pairs
inferred← citeshttps://doi.org/10.1007/978-3-319-00966-7_1openalex-snapshot
Foundations of Mathematics from the Perspective of Computer Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_3openalex-snapshot
Towards a Formally Verified Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_28openalex-snapshot
Verifying Android’s Permission Model
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_36openalex-snapshot
First Steps Towards Cumulative Inductive Types in CIC
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-319-94821-8_24openalex-snapshot
Relational Parametricity and Quotient Preservation for Modular (Co)datatypes
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_11openalex-snapshot
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_3openalex-snapshot
Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_11openalex-snapshot
First-Order Reasoning in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_19openalex-snapshot
Induction and Co-induction in Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_22openalex-snapshot
Some Algebraic Structures in Lambda-Calculus with Inductive Types
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_5openalex-snapshot
A Constructive Proof of Higman’s Lemma in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_10openalex-snapshot
Interfacing Hoare Logic and Type Systems for Foundational Proof-Carrying Code
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_26openalex-snapshot
Proof Search and Proof Check for Equational and Inductive Theorems
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_9openalex-snapshot
Foundational Certified Code in a Metalogical Framework
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-70594-9_17openalex-snapshot
A Hoare Logic for Call-by-Value Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_6openalex-snapshot
Intuitionistic Refinement Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-75227-1_15openalex-snapshot
A Formal Specification of the MIDP 2.0 Security Model
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-540-85110-3_31openalex-snapshot
Logic-Free Reasoning in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-540-87873-5_8openalex-snapshot
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_21openalex-snapshot
Lexicographic Path Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_16openalex-snapshot
Dual Calculus with Inductive and Coinductive Types
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_3openalex-snapshot
A New Elimination Rule for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_24openalex-snapshot
Practical Tactics for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_31openalex-snapshot
Inductive Consequences in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_7openalex-snapshot
Partial Derivative Automata Formalized in Coq
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-31374-5_21openalex-snapshot
Reasoning on Schemata of Formulæ
inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_16openalex-snapshot
Alternating-Time Temporal Logic in the Calculus of (Co)Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_7openalex-snapshot
Deciding Regular Expressions (In-)Equivalence in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-35786-2_11openalex-snapshot
Modeling Ontological Structures with Type Classes in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_5openalex-snapshot
Axiomatisations, Proofs, and Formal Specifications of Algorithms: Commented Case Studies in the Coq Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-7643-8653-5_16openalex-snapshot
Proof theory and Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-007-4435-6_11openalex-snapshot
Program Testing and the Meaning Explanations of Intuitionistic Type Theory
inferred← citeshttps://doi.org/10.1007/978-981-99-8311-7_8openalex-snapshot
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/bf01211457openalex-snapshot
Verifying programs in the calculus of inductive constructions
inferred← citeshttps://doi.org/10.1007/bf01212523openalex-snapshot
Formalizing process algebraic verifications in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bfb0014049openalex-snapshot
Higher-order abstract syntax in Coq
inferred← citeshttps://doi.org/10.1007/bfb0014061openalex-snapshot
Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq
inferred← citeshttps://doi.org/10.1007/bfb0026991openalex-snapshot
Proof principles for datatypes with iterated recursion
inferred← citeshttps://doi.org/10.1007/bfb0054171openalex-snapshot
A verified model checker for the modal Μ-calculus in Coq
inferred← citeshttps://doi.org/10.1007/bfb0055070openalex-snapshot
Structural recursive definitions in type theory
inferred← citeshttps://doi.org/10.1007/bfb0055149openalex-snapshot
Formal specification and theorem proving breakthroughs in geometric modeling
inferred← citeshttps://doi.org/10.1007/bfb0097788openalex-snapshot
A type-free formalization of mathematics where proofs are objects
inferred← citeshttps://doi.org/10.1007/bfb0105401openalex-snapshot
Coq and hardware verification: A case study
inferred← citeshttps://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferred← citeshttps://doi.org/10.1007/s00220-024-05020-8openalex-snapshot
Topological Quantum Gates in Homotopy Type Theory
inferred← citeshttps://doi.org/10.1007/s003710050095openalex-snapshot
Algebras and formal specifications in geometric modelling
inferred← citeshttps://doi.org/10.1007/s10817-009-9117-xopenalex-snapshot
An Intuitionistic Proof of a Discrete Form of the Jordan Curve Theorem Formalized in Coq with Combinatorial Hypermaps
inferred← citeshttps://doi.org/10.1007/s10817-023-09666-2openalex-snapshot
An Automatically Verified Prototype of the Android Permissions System
inferred← citeshttps://doi.org/10.1007/s10990-006-8611-7openalex-snapshot
Polymorphic typed defunctionalization and concretization
inferred← citeshttps://doi.org/10.1007/s11390-007-9049-zopenalex-snapshot
Garbage Collector Verification for Proof-Carrying Code
inferred← citeshttps://doi.org/10.1007/s44163-026-02252-6openalex-snapshot
Admissibility defines structural limits on optimisation in artificial intelligence
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00029-1openalex-snapshot
Exceptions considered harmless
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50020-5openalex-snapshot
Proof-Assistants Using Dependent Type Systems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.04.007openalex-snapshot
Formal specification and proofs for the topology and classification of combinatorial surfaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.073openalex-snapshot
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.06.008openalex-snapshot
Coinductive Field of Exact Real Numbers and General Corecursion
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.018openalex-snapshot
Inductive and Coinductive Components of Corecursive Functions in Coq
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.011openalex-snapshot
Experimenting Formal Proofs of Petri Nets Refinements
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.03.019openalex-snapshot
Finitary Higher Inductive Types in the Groupoid Model
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.008openalex-snapshot
Transitivity in coercive subtyping
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.jlap.2005.07.001openalex-snapshot
Indexed induction–recursion
inferred← citeshttps://doi.org/10.1016/j.patcog.2007.02.013openalex-snapshot
Design and formal proof of a new optimal image segmentation program with hypermaps
inferred← citeshttps://doi.org/10.1016/j.scico.2004.01.003openalex-snapshot
Building certified libraries for PCC: dynamic storage allocation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.012openalex-snapshot
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00096-9openalex-snapshot
Induction–recursion and initial algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00095-5openalex-snapshot
π-calculus in (Co)inductive-type theory
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.1016/s0304-3975(00)00418-7openalex-snapshot
Primitive recursion for higher-order abstract syntax
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00228-xopenalex-snapshot
Formalizing mathematics in higher-order logic: A case study in geometric modelling
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00171-1openalex-snapshot
Cut-elimination for a logic with definitions and induction
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80007-6openalex-snapshot
Synthesis of ML programs in the system Coq
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00278-6openalex-snapshot
Developing (Meta)Theory of λ-calculus in the Theory of Contexts1 1Work partially supported by Italian MURST project tosca and EC-WG types.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00295-6openalex-snapshot
Certifying Term Rewriting Proofs in ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00323-8openalex-snapshot
The Theory of Contexts for First Order and Higher Order Abstract Syntax
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80507-3openalex-snapshot
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80760-6openalex-snapshot
Remarks on Isomorphisms of Simple Inductive Types
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.003openalex-snapshot
An introduction to (co)algebra and (co)induction
inferred← citeshttps://doi.org/10.1017/s0956796800001106openalex-snapshot
Residual theory in λ-calculus: a formal development
inferred← citeshttps://doi.org/10.1017/s095679680200446xopenalex-snapshot
Verification of non-functional programs using interpretations in type theory
inferred← citeshttps://doi.org/10.1017/s0956796802004641openalex-snapshot
Termination of rewriting in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1017/s0956796810000079openalex-snapshot
Parametricity, type equality, and higher-order polymorphism
inferred← citeshttps://doi.org/10.1017/s0956796816000174openalex-snapshot
Eliminating dependent pattern matching without K
inferred← citeshttps://doi.org/10.1017/s0960129501003346openalex-snapshot
Recursion over objects of functional type
inferred← citeshttps://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferred← citeshttps://doi.org/10.1017/s0960129505004950openalex-snapshot
Isomorphisms of simple inductive types through extensional rewriting
inferred← citeshttps://doi.org/10.1017/s0960129506005809openalex-snapshot
Affine functions and series with co-inductive real numbers
inferred← citeshttps://doi.org/10.1017/s0960129506005834openalex-snapshot
Constructive analysis, types and exact real numbers
inferred← citeshttps://doi.org/10.1017/s0960129508006956openalex-snapshot
Structural subtyping for inductive types with functorial equality rules
inferred← citeshttps://doi.org/10.1017/s0960129511000120openalex-snapshot
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1017/s0960129514000577openalex-snapshot
An experimental library of formalized Mathematics based on the univalent foundations
inferred← citeshttps://doi.org/10.1017/s0960129523000348openalex-snapshot
Material dialogues for first-order logic in constructive type theory: extended version
inferred← citeshttps://doi.org/10.1017/s0960129599002790openalex-snapshot
Final coalgebras as greatest fixed points in ZF set theory
inferred← citeshttps://doi.org/10.1023/a:1021975117537openalex-snapshot
External Rewriting for Skeptical Proof Assistants
inferred← citeshttps://doi.org/10.1023/b:jars.0000021012.97318.e9openalex-snapshot
A Syntactic Approach to Foundational Proof-Carrying Code
inferred← citeshttps://doi.org/10.1080/00207160802676604openalex-snapshot
A case-study in algebraic manipulation using mechanized reasoning tools
inferred← citeshttps://doi.org/10.1093/logcom/exac068openalex-snapshot
Constructive and mechanised meta-theory of IEL and similar modal logics
inferred← citeshttps://doi.org/10.1093/logcom/exq052openalex-snapshot
Sequent calculi for induction and infinite descent
inferred← citeshttps://doi.org/10.1093/philmat/nkv014openalex-snapshot
Identity in Homotopy Type Theory, Part I: The Justification of Path Induction
inferred← citeshttps://doi.org/10.1109/ase.2001.989789openalex-snapshot
The synthesis of a Java card tokenisation algorithm
inferred← citeshttps://doi.org/10.1109/dsa.2017.29openalex-snapshot
Formal Derivation and Verification of Coordinate Transformations in Theorem Prover Coq
inferred← citeshttps://doi.org/10.1109/fits.2003.1264928openalex-snapshot
A type system for certi .ed binaries
inferred← citeshttps://doi.org/10.1109/kbse.1995.490133openalex-snapshot
Towards high-level deductive program synthesis based on type theory
inferred← citeshttps://doi.org/10.1109/lics.1999.782617openalex-snapshot
A new approach to abstract syntax involving binders
inferred← citeshttps://doi.org/10.1109/lics.2001.932478openalex-snapshot
Definitions by rewriting in the calculus of constructions
inferred← citeshttps://doi.org/10.1109/lics.2002.1029819openalex-snapshot
A syntactic approach to foundational proof-carrying code
inferred← citeshttps://doi.org/10.1109/lics.2007.16openalex-snapshot
Complete Sequent Calculi for Induction and Infinite Descent
inferred← citeshttps://doi.org/10.1109/lics.2012.21openalex-snapshot
Inductive Types in Homotopy Type Theory
inferred← citeshttps://doi.org/10.1109/lics.2012.22openalex-snapshot
Combining Deduction Modulo and Logics of Fixed-Point Definitions
inferred← citeshttps://doi.org/10.1109/lics.2012.9openalex-snapshot
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer
inferred← citeshttps://doi.org/10.1109/lics.2017.8005074openalex-snapshot
Bar induction: The good, the bad, and the ugly
inferred← citeshttps://doi.org/10.1109/lics.2019.8785661openalex-snapshot
Path Spaces of Higher Inductive Types in Homotopy Type Theory
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.1109/sefm.2004.1347524openalex-snapshot
Random testing in Isabelle/HOL
inferred← citeshttps://doi.org/10.1109/ssiri.2009.8openalex-snapshot
On the Verification of Strong Atomicity in Programs Using STM
showing the first 200 of 341 · page through all 341
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.