On the public citation graph
Higher-order abstract syntax in Coq
0 signed · 145 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-55602-8_190openalex-snapshot
Implementing the meta-theory of deductive systems
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/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferredcites →https://doi.org/10.1007/bfb0013606openalex-snapshot
A logic programming approach to implementing higher-Order term rewriting
inferredcites →https://doi.org/10.1007/bfb0013612openalex-snapshot
Natural semantics and some of its meta-theory in Elf
inferredcites →https://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferredcites →https://doi.org/10.1017/s0960129500001559openalex-snapshot
From operational semantics to abstract machines
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11532231_4openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/11814771_3openalex-snapshot
Representing and Reasoning with Operational Semantics
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_24openalex-snapshot
Multi-level Meta-reasoning with Higher-Order Abstract Syntax
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-44957-4_16openalex-snapshot
Abstract Syntax for Variable Binders: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_24openalex-snapshot
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_12openalex-snapshot
A Logic Programming Language Based on Binding Algebras
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_14openalex-snapshot
Two-Level Meta-reasoning in Coq
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_3openalex-snapshot
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_8openalex-snapshot
A Kripke-Style Model for the Admissibility of Structural Rules
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_78openalex-snapshot
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_15openalex-snapshot
Mechanized Operational Semantics via (Co)Induction
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_52openalex-snapshot
Formalizing a Lazy Substitution Proof System for π-Calculus in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
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/978-3-030-33636-3_12openalex-snapshot
Shallow Embedding of Type Theory is Morally Correct
inferred← citeshttps://doi.org/10.1007/978-3-030-64437-6_9openalex-snapshot
Certified Semantics for Relational Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_36openalex-snapshot
Rensets and Renaming-Based Recursion for Syntax with Bindings
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_16openalex-snapshot
A Formalized General Theory of Syntax with Bindings
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-27775-0_19openalex-snapshot
αProlog: A Logic Programming Language with Names, Binding and α-Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_20openalex-snapshot
A Dependent Type Theory with Names and Binding
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_4openalex-snapshot
Imperative Object-Based Calculi in Co-inductive Type Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-45191-4_4openalex-snapshot
Chapter 4. Basic Category Theory for Models of Syntax
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_5openalex-snapshot
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_5openalex-snapshot
Syntax for Free: Representing Syntax with Binding Using Parametricity
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_22openalex-snapshot
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_22openalex-snapshot
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_3openalex-snapshot
Generic Reasoning of the Locally Nameless Representation
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_15openalex-snapshot
Formalization of Lambda Calculus with Explicit Names as a Nominal Reasoning Framework
inferred← citeshttps://doi.org/10.1007/bfb0055141openalex-snapshot
Free variables and subexpressions in higher-order meta logic
inferred← citeshttps://doi.org/10.1007/s001650050046openalex-snapshot
Formalising a Value-Passing Calculus in HOL
inferred← citeshttps://doi.org/10.1007/s10817-006-9061-yopenalex-snapshot
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
inferred← citeshttps://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-011-9218-1openalex-snapshot
A Two-Level Logic Approach to Reasoning About Computations
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1007/s10817-019-09522-2openalex-snapshot
A Formalized General Theory of Syntax with Bindings: Extended Version
inferred← citeshttps://doi.org/10.1007/s10817-019-09527-xopenalex-snapshot
Formalization of Metatheory of the Quipper Quantum Programming Language in a Linear Logic
inferred← citeshttps://doi.org/10.1007/s10817-023-09672-4openalex-snapshot
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version
inferred← citeshttps://doi.org/10.1007/s10990-006-8747-5openalex-snapshot
An initial algebra approach to term rewriting systems with variable binders
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.022openalex-snapshot
Plug and Play the Theory of Contexts in Higher-Order Abstract Syntax
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.016openalex-snapshot
A Logic for Reasoning about Generic Judgments
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.010openalex-snapshot
A Coq Library for Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.009openalex-snapshot
Canonical HybridLF: Extending Hybrid with Dependent Types
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.10.014openalex-snapshot
Mechanizing Focused Linear Logic in Coq
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.019openalex-snapshot
Mechanizing type environments in weak HOAS
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)00418-7openalex-snapshot
Primitive recursion for higher-order abstract syntax
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)80506-1openalex-snapshot
A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity
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.1017/cbo9780511605321.005openalex-snapshot
Higher-order abstract syntax in type theory
inferred← citeshttps://doi.org/10.1017/s0956796802004653openalex-snapshot
A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis
inferred← citeshttps://doi.org/10.1017/s0956796806005892openalex-snapshot
Consistency of the theory of contexts
inferred← citeshttps://doi.org/10.1017/s0956796807006557openalex-snapshot
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
inferred← citeshttps://doi.org/10.1017/s0956796819000170openalex-snapshot
POPLMark reloaded: Mechanizing proofs by logical relations
inferred← citeshttps://doi.org/10.1017/s0960129501003346openalex-snapshot
Recursion over objects of functional type
inferred← citeshttps://doi.org/10.1017/s0960129511000041openalex-snapshot
The representational adequacy of Hybrid
inferred← citeshttps://doi.org/10.1017/s0960129521000323openalex-snapshot
A focused linear logical framework and its application to metatheory of object logics
inferred← citeshttps://doi.org/10.1017/s0960129522000287openalex-snapshot
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1109/lics.1996.561309openalex-snapshot
Reduction-free normalisation for a polymorphic system
inferred← citeshttps://doi.org/10.1109/lics.1997.614968openalex-snapshot
A logic for reasoning with higher-order abstract syntax
inferred← citeshttps://doi.org/10.1109/lics.1999.782616openalex-snapshot
Semantical analysis of higher-order abstract syntax
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.2008.48openalex-snapshot
Focusing on Binding and Computation
inferred← citeshttps://doi.org/10.1109/lics.2010.48openalex-snapshot
Strong Normalization for System F by HOAS on Top of FOAS
inferred← citeshttps://doi.org/10.1109/lics.2019.8785683openalex-snapshot
A Type Theory for Defining Logics and Proofs
inferred← citeshttps://doi.org/10.1145/1088454.1088456openalex-snapshot
A computational approach to reflective meta-reasoning about languages with bindings
inferred← citeshttps://doi.org/10.1145/1088454.1088459openalex-snapshot
Toward a general theory of names
inferred← citeshttps://doi.org/10.1145/1088454.1088462openalex-snapshot
Combining higher-order abstract syntax with first-order abstract syntax in ATS
inferred← citeshttps://doi.org/10.1145/1190215.1190245openalex-snapshot
Towards a mechanized metatheory of standard ML
inferred← citeshttps://doi.org/10.1145/1273920.1273933openalex-snapshot
Higher-order semantic labelling for inductive datatype systems
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1328438.1328482openalex-snapshot
Focusing and higher-order abstract syntax
inferred← citeshttps://doi.org/10.1145/1328897.1328482openalex-snapshot
Focusing and higher-order abstract syntax
inferred← citeshttps://doi.org/10.1145/1411203.1411226openalex-snapshot
Parametric higher-order abstract syntax for mechanized semantics
inferred← citeshttps://doi.org/10.1145/1577824.1577826openalex-snapshot
Higher-order abstract syntax in classical higher-order logic
inferred← citeshttps://doi.org/10.1145/1577824.1577827openalex-snapshot
Theory support for weak higher order abstract syntax in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/1596550.1596571openalex-snapshot
A universe of binding and computation
inferred← citeshttps://doi.org/10.1145/1599410.1599422openalex-snapshot
Reasoning with hypothetical judgments and open terms in hybrid
inferred← citeshttps://doi.org/10.1145/1631687.1596571openalex-snapshot
A universe of binding and computation
inferred← citeshttps://doi.org/10.1145/2034574.2034807openalex-snapshot
A hierarchy of mendler style recursion combinators
inferred← citeshttps://doi.org/10.1145/2034574.2034819openalex-snapshot
Recursion principles for syntax with bindings and substitution
inferred← citeshttps://doi.org/10.1145/2034773.2034807openalex-snapshot
A hierarchy of mendler style recursion combinators
inferred← citeshttps://doi.org/10.1145/2364527.2364541openalex-snapshot
Functional programming with structured graphs
inferred← citeshttps://doi.org/10.1145/2503887.2503896openalex-snapshot
25 years of formal proof cultures
inferred← citeshttps://doi.org/10.1145/2631172.2631180openalex-snapshot
Internal Adequacy of Bookkeeping in Coq
inferred← citeshttps://doi.org/10.1145/3293880.3294101openalex-snapshot
Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions
inferred← citeshttps://doi.org/10.1145/3354166.3354177openalex-snapshot
Functional programming with λ-tree syntax
inferred← citeshttps://doi.org/10.1145/3408970openalex-snapshot
A general approach to define binders using matching logic
inferred← citeshttps://doi.org/10.1145/3622810openalex-snapshot
Mechanizing Session-Types using a Structural View: Enforcing Linearity without Linearity
inferred← citeshttps://doi.org/10.1145/3672608.3707907openalex-snapshot
A Mechanized Formalization of an FRP Language with Effects
inferred← citeshttps://doi.org/10.1145/3808269openalex-snapshot
Contextual Embeddings: Implementing Bound Variables through Instance Resolution
inferred← citeshttps://doi.org/10.1145/3838790.3838793openalex-snapshot
Effects with Variable Binding
inferred← citeshttps://doi.org/10.1145/504077.504080openalex-snapshot
Reasoning with higher-order abstract syntax in a logical framework
inferred← citeshttps://doi.org/10.1145/888251.888266openalex-snapshot
Term rewriting with variable binding
inferred← citeshttps://doi.org/10.1145/976571.976572openalex-snapshot
A definitional approach to primitivexs recursion over higher order abstract syntax
inferred← citeshttps://doi.org/10.1145/976571.976574openalex-snapshot
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:8)2012openalex-snapshot
A dependent nominal type theory
inferred← citeshttps://doi.org/10.4204/eptcs.113openalex-snapshot
A very brief introduction to hybrid logic and hybrid-logical proof-theory:Extended abstract of invited talk
inferred← citeshttps://doi.org/10.4204/eptcs.113.11openalex-snapshot
A weak HOAS approach to the POPLmark Challenge
inferred← citeshttps://doi.org/10.4204/eptcs.449.15openalex-snapshot
A Machine-checked Proof of Consistency for Impredicative Pure Type Systems
inferred← citeshttps://doi.org/10.4204/eptcs.71.6openalex-snapshot
An Improved Implementation and Abstract Interface for Hybrid
inferred← citeshttps://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
inferred← citeshttps://doi.org/10.48456/tr-772openalex-snapshot
An executable meta-language for inductive definitions with binders
inferred← citeshttps://doi.org/10.48550/arxiv.0811.4367openalex-snapshot
Hybrid: A Definitional Two-Level Approach to Reasoning with Higher-Order Abstract Syntax
inferred← citeshttps://doi.org/10.48550/arxiv.0812.4727openalex-snapshot
Induction and Co-induction in Sequent Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2993openalex-snapshot
A two-level logic approach to reasoning about computations
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03363openalex-snapshot
A Higher-Order Abstract Syntax Approach to the Verified Compilation of Functional Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11674openalex-snapshot
Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0511025openalex-snapshot
Logic Column 14: Nominal Logic and Abstract Syntax
inferred← citeshttps://doi.org/10.5281/zenodo.16643466openalex-snapshot
The Cresson Types Of Hymenoptera.
inferred← citeshttps://doi.org/10.5281/zenodo.41682openalex-snapshot
The Polar Edge Coherence: A Quasi Blind Metric For Video Quality Assessment
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/9757openalex-snapshot
LF+ in Coq for "fast and loose" reasoning
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/4714cfc0z7540z46edz8647z654a35f388b1openalex-snapshot
A logical study of program equivalence
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
inferred← citeshttps://doi.org/10.70675/d1b208b0z61b4z4257z9fc7ze71c0d7c3e37openalex-snapshot
Computing with relations, functions, and bindings
inferred← citeshttps://doi.org/10.7907/s0hg-rt72.openalex-snapshot
Reflection and its application to mechanized metareasoning about programming languages
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.