On the public citation graph
Natural semantics and some of its meta-theory in Elf
0 signed · 50 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-50517-2_85openalex-snapshot
A natural deduction treatment of operational semantics
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/bfb0013612openalex-snapshot
Natural semantics and some of its meta-theory in Elf
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1109/lics.1989.39186openalex-snapshot
Elf: a language for logic definition and verified metaprogramming
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/319838.319847openalex-snapshot
A simple applicative language: mini-ML
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/91556.91680openalex-snapshot
From operational semantics to abstract machines: preliminary results
inferredcites →https://doi.org/10.1184/r1/6610223openalex-snapshot
Systems of polymorphic type assignment in LF
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-44659-1_9openalex-snapshot
Proving ML Type Soundness Within Coq
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_190openalex-snapshot
Implementing the meta-theory of deductive systems
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_80openalex-snapshot
The expressive power of Structural Operational Semantics with explicit assumptions
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_42openalex-snapshot
Representing proof transformations for program optimization
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_66openalex-snapshot
Elf: A meta-language for deductive systems
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_35openalex-snapshot
Program extraction in a Logical Framework setting
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-61055-3_44openalex-snapshot
Mode and termination checking for higher-order logic programs
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-61780-9_69openalex-snapshot
A natural deduction approach to dynamic logic
inferred← citeshttps://doi.org/10.1007/978-3-030-98869-2_6openalex-snapshot
Towards Substructural Property-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-39815-8_6openalex-snapshot
Staged Notational Definitions
inferred← citeshttps://doi.org/10.1007/bfb0014049openalex-snapshot
Higher-order abstract syntax in Coq
inferred← citeshttps://doi.org/10.1007/bfb0026826openalex-snapshot
Mechanically verifying the correctness of an offline partial evaluator
inferred← citeshttps://doi.org/10.1007/bfb0054266openalex-snapshot
Automated theorem proving in a simple meta-logic for LF
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80510-3openalex-snapshot
Towards Proof Planning for ω+
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80693-0openalex-snapshot
An Operational Semantics Framework Supporting the Incremental Construction of Derivation Trees
inferred← citeshttps://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1093/logcom/8.1.5openalex-snapshot
A module system for a programming language based on the LF logical framework
inferred← citeshttps://doi.org/10.21236/ada256574openalex-snapshot
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
inferred← citeshttps://doi.org/10.7146/dpb.v24i493.7021openalex-snapshot
Particpants' Proceedings on the Workshop: Types for Program Analysis
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0034openalex-snapshot
The Relative Complement Problem for Higher-Order Patterns
showing the first 34 of 35 · page through all 35
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.