On the public citation graph
Using typed lambda calculus to implement formal systems on a machine
0 signed · 119 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-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-52885-7_90openalex-snapshot
Encoding a dependent-type λ-calculus in a logic programming language
inferredcites →https://doi.org/10.1007/978-1-4612-3658-0_8openalex-snapshot
An Overview of the Edinburgh Logical Framework
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bf00264250openalex-snapshot
A logic covering undefinedness in program proofs
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(88)90037-0openalex-snapshot
The semantics and proof theory of linear logic
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
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.1109/lics.1989.39193openalex-snapshot
ECC, an extended calculus of constructions
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference
inferredcites →https://doi.org/10.1145/62678.62697openalex-snapshot
Partial polymorphic type inference and higher-order unification
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.48456/tr-82openalex-snapshot
Natural deduction proof as higher-order resolution
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.2858openalex-snapshot
Structuring Metatheory on Inductive Definitions
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/3-540-48167-2_10openalex-snapshot
Metatheory of Verification Calculi in LEGO
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_13openalex-snapshot
A support system for formal reasoning: Requirements and status
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-56944-8_49openalex-snapshot
A new type theory for representing logics
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_52openalex-snapshot
Finitary partial inductive definitions as a general logic
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-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/3-540-63104-6_31openalex-snapshot
A practical implementation of simple consequence relations using inductive definitions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3544-9_1openalex-snapshot
Constrained Proofs: A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_8openalex-snapshot
Extracting programs from proofs by an extension of the Curry-Howard process
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_1openalex-snapshot
Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot
Twenty Years of Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_8openalex-snapshot
Logic Programming and Meta-Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_7openalex-snapshot
Transitive Closure and the Mechanization of Mathematics
inferred← citeshttps://doi.org/10.1007/bf01063152openalex-snapshot
A note on the proof theory the ?II-calculus
inferred← citeshttps://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferred← citeshttps://doi.org/10.1007/bfb0013180openalex-snapshot
GLEFATINF:A graphic framework for combining theorem provers and editing proofs for different logics
inferred← citeshttps://doi.org/10.1007/bfb0014049openalex-snapshot
Higher-order abstract syntax in Coq
inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot
From abstract data types to logical frameworks
inferred← citeshttps://doi.org/10.1007/bfb0014564openalex-snapshot
Extending a logical framework with a modal connective for validity
inferred← citeshttps://doi.org/10.1007/bfb0040259openalex-snapshot
Inductively defined types in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00002-xopenalex-snapshot
A metatheory of a mechanized object theory
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90009-4openalex-snapshot
Structured theory presentations and logic representations
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90037-0openalex-snapshot
The semantics and proof theory of linear logic
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00045-xopenalex-snapshot
Forum: A multiple-conclusion specification logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.017openalex-snapshot
Hierarchical Nominal Terms and Their Theory of Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.014openalex-snapshot
A Framework for Defining Logical Frameworks
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.06.003openalex-snapshot
Twenty years of rewriting logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.019openalex-snapshot
Mechanizing type environments in weak HOAS
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70270-2openalex-snapshot
Finitary inductively presented logics
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)00175-4openalex-snapshot
Subtyping dependent types
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00047-9openalex-snapshot
A first order logic of effects
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
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)00324-xopenalex-snapshot
Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic
inferred← citeshttps://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferred← citeshttps://doi.org/10.1017/s0960129500000785openalex-snapshot
Equivalences between logics and their representing type theories
inferred← citeshttps://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferred← citeshttps://doi.org/10.1017/s0960129512000424openalex-snapshot
A logical framework combining model and proof theory
inferred← citeshttps://doi.org/10.1017/s0960129599002856openalex-snapshot
Some logical and syntactical observations concerning the first-order dependent type system λP
inferred← citeshttps://doi.org/10.1023/a:1005060022386openalex-snapshot
Encoding Modal Logics in Logical Frameworks
inferred← citeshttps://doi.org/10.1093/logcom/12.6.1061openalex-snapshot
Kripke Resource Models of a Dependently-typed, Bunched -calculus
inferred← citeshttps://doi.org/10.1093/logcom/6.6.835openalex-snapshot
Adding metatheoretic facilities to first-order theories
inferred← citeshttps://doi.org/10.1093/logcom/7.6.685openalex-snapshot
Labelled propositional modal logics: theory and practice
inferred← citeshttps://doi.org/10.1093/logcom/8.6.809openalex-snapshot
A relevant analysis of natural deduction
inferred← citeshttps://doi.org/10.1093/oso/9780198538592.003.0013openalex-snapshot
A Theory and its Metatheory in FS 0
inferred← citeshttps://doi.org/10.1109/lics.1989.39177openalex-snapshot
Structure and representation in LF
inferred← citeshttps://doi.org/10.1109/lics.1989.39186openalex-snapshot
Elf: a language for logic definition and verified metaprogramming
inferred← citeshttps://doi.org/10.1109/lics.1994.316062openalex-snapshot
A multiple-conclusion meta-logic
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.2010.48openalex-snapshot
Strong Normalization for System F by HOAS on Top of FOAS
inferred← citeshttps://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferred← citeshttps://doi.org/10.1145/1863543.1863565openalex-snapshot
Higher-order representation of substructural logics
inferred← citeshttps://doi.org/10.1145/211782.211821openalex-snapshot
A logical framework for software proof reuse
inferred← citeshttps://doi.org/10.1145/223427.211821openalex-snapshot
A logical framework for software proof reuse
inferred← citeshttps://doi.org/10.1145/2503887.2503896openalex-snapshot
25 years of formal proof cultures
inferred← citeshttps://doi.org/10.1145/3234693openalex-snapshot
A Modular Type Reconstruction Algorithm
inferred← citeshttps://doi.org/10.1145/3354166.3354177openalex-snapshot
Functional programming with λ-tree syntax
inferred← citeshttps://doi.org/10.1145/360204.360216openalex-snapshot
Oracle-based checking of untrusted software
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/373243.360216openalex-snapshot
Oracle-based checking of untrusted software
inferred← citeshttps://doi.org/10.1145/504077.504080openalex-snapshot
Reasoning with higher-order abstract syntax in a logical framework
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635337openalex-snapshot
Gentzenizing Schroeder-Heister's natural extension of natural deduction.
inferred← citeshttps://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferred← citeshttps://doi.org/10.17863/cam.23641openalex-snapshot
The Foundation of a Generic Theorem Prover
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:8)2012openalex-snapshot
A dependent nominal type theory
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:2)2017openalex-snapshot
$\mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads
inferred← citeshttps://doi.org/10.23638/lmcs-14(4:1)2018openalex-snapshot
Applicable Mathematics in a Minimal Computational Theory of Sets
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.400openalex-snapshot
Proceedings 12th International Workshop on Theorem proving components for Educational software
inferred← citeshttps://doi.org/10.4204/eptcs.400.2openalex-snapshot
WebPie: A Tiny Slice of Dependent Typing
inferred← citeshttps://doi.org/10.5281/zenodo.26347openalex-snapshot
Leptothorax Fuentei Santschi, 1919, En France (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.5281/zenodo.26351openalex-snapshot
The Male Of Leptothorax Risi Forel, 1892 (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4650openalex-snapshot
Abella: A System for Reasoning about Relational Specifications
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/9757openalex-snapshot
LF+ in Coq for "fast and loose" reasoning
inferred← citeshttps://doi.org/10.70675/1dfc9503z30eez4554za597zdd6658262d15openalex-snapshot
Development and verification of probability logics and logical frameworks
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.