On the public citation graph

Automated theorem proving in a simple meta-logic for LF

0 signed · 64 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-55602-8_190openalex-snapshot

Implementing the meta-theory of deductive systems

inferredcites →https://doi.org/10.1007/3-540-58156-1_66openalex-snapshot

Elf: A meta-language for deductive systems

inferredcites →https://doi.org/10.1007/3-540-58156-1_68openalex-snapshot

Pi: An interactive derivation editor for the calculus of partial inductive definitions

inferredcites →https://doi.org/10.1007/3-540-61055-3_44openalex-snapshot

Mode and termination checking for higher-order logic programs

inferredcites →https://doi.org/10.1007/3-540-61064-2_33openalex-snapshot

The practice of logical frameworks

inferredcites →https://doi.org/10.1007/3-540-62688-3_34openalex-snapshot

Primitive recursion for higher-order abstract syntax

inferredcites →https://doi.org/10.1007/bfb0013612openalex-snapshot

Natural semantics and some of its meta-theory in Elf

inferredcites →https://doi.org/10.1007/bfb0054266openalex-snapshot

Automated theorem proving in a simple meta-logic for LF

inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot

An algorithm for testing conversion in type theory

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

Lambda Calculus with Types

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

Unification and anti-unification in the calculus of constructions

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

Rules of definitional reflection

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

A linear logical framework

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

A logic for reasoning with higher-order abstract syntax

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.1006/inco.2001.2951openalex-snapshot

A Linear Logical Framework

inferred← citeshttps://doi.org/10.1007/10704567_12openalex-snapshot

Logical and Meta-Logical Frameworks

inferred← citeshttps://doi.org/10.1007/11617990_10openalex-snapshot

A Tool for Automated Theorem Proving in Agda

inferred← citeshttps://doi.org/10.1007/11814771_33openalex-snapshot

First-Order Logic with Dependent Types

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-44622-2_28openalex-snapshot

Elimination of Negation in a Logical Framework

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-48167-2_4openalex-snapshot

A Modal Lambda Calculus with Iteration and Case Constructs

inferred← citeshttps://doi.org/10.1007/3-540-48660-7_14openalex-snapshot

System Description: Twelf — A Meta-Logical Framework for Deductive Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_38openalex-snapshot

Harpoon: Mechanizing Metatheory Interactively

inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_16openalex-snapshot

Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework

inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_24openalex-snapshot

Focused Inductive Theorem Proving

inferred← citeshttps://doi.org/10.1007/bfb0054240openalex-snapshot

Reasoning about deductions in linear logic

inferred← citeshttps://doi.org/10.1007/s10817-015-9327-3openalex-snapshot

The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations

inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot

Mechanized Metatheory Revisited

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot

Logical Frameworks

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.ic.2010.09.004openalex-snapshot

Nominal abstraction

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/s1571-0661(04)80509-7openalex-snapshot

Memoization-Based Proof Search in LF

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01181-3openalex-snapshot

Algorithms for Equality and Unification in the Presence of Notational Definitions

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

Mechanizing metatheory in a logical framework

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

Recursion over objects of functional type

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

Combining Generic Judgments with Recursive Definitions

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.1145/1013560.1013566openalex-snapshot

Reflective metalogical frameworks

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

Automatic inference of optimizer flow functions from semantic meanings

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

Automatic inference of optimizer flow functions from semantic meanings

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

Recursion principles for syntax with bindings and substitution

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

Towards extracting explicit proofs from totality checking in twelf

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

Type systems for the masses: deriving soundness proofs and efficient checkers

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

Sound type-dependent syntactic language extension

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

Sound type-dependent syntactic language extension

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

Dependent types in practical programming

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/581478.581497openalex-snapshot

An expressive, scalable type theory for certified code

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

Implementing typeful program transformations

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

Higher-order pattern complement and the strict λ-calculus

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

Termination and Reduction Checking in the Logical Framework

inferred← citeshttps://doi.org/10.21236/ada341557openalex-snapshot

The Fox Project: Advanced Language Technology for Extensible Systems

inferred← citeshttps://doi.org/10.29007/22x6openalex-snapshot

Using Vampire in Soundness Proofs of Type Systems

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

Semi-Automation of Meta-Theoretic Proofs in Beluga

inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.345openalex-snapshot

Type Preservation as a Confluence Problem

inferred← citeshttps://doi.org/10.4230/lipics.tlca.2015.273openalex-snapshot

Well-Founded Recursion over Contextual Objects

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

Nominal Abstraction

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

Towards Extracting Explicit Proofs from Totality Checking in Twelf

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

A Framework for Reasoning About LF Specifications

showing the first 48 of 49 · page through all 49

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.