On the public citation graph

Typed Lambda Calculi and Applications

https://doi.org/10.1007/bfb0037093
0 signed · 44 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1998.2725openalex-snapshot
Structural Induction and Coinduction in a Fibrational Setting
inferred← citeshttps://doi.org/10.1006/inco.2002.2957openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.1007/11617990_4openalex-snapshot
Extracting a Normalization Algorithm in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_82openalex-snapshot
Closure under alpha-conversion
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_44openalex-snapshot
Effective longest and infinite reduction paths in untyped λ-calculi
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_25openalex-snapshot
A λ-to-CL translation for strong normalization
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00062-8openalex-snapshot
Towards the computational complexity of ℘Rω-terms
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90094-aopenalex-snapshot
Set-theoretical and other elementary models of the λ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00283-oopenalex-snapshot
A characterization of lambda definability in categorical models of implicit polymorphism
inferred← citeshttps://doi.org/10.1016/b978-0-323-95504-1.00195-2openalex-snapshot
Propositions as Types
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.006openalex-snapshot
Uniform Heyting arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.005openalex-snapshot
Coherence in smccs and equivalences on derivations in imll with unit
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.11.056openalex-snapshot
Program Extraction From Proofs of Weak Head Normalization
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.057openalex-snapshot
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.058openalex-snapshot
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.071openalex-snapshot
Practical Program Extraction from Classical Proofs
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.009openalex-snapshot
Normalization for the Simply-Typed Lambda-Calculus in Twelf
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.2009.07.090openalex-snapshot
A Context-based Approach to Proving Termination of Evaluation
inferred← citeshttps://doi.org/10.1016/j.jal.2007.11.001openalex-snapshot
The seven virtues of simple type theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.023openalex-snapshot
An arithmetic for non-size-increasing polynomial-time computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.042openalex-snapshot
The Girard–Reynolds isomorphism (second edition)
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.045openalex-snapshot
On strong normalization and type inference in the intersection type discipline
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00101-1openalex-snapshot
The modified realizability topos
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00073-2openalex-snapshot
Refined program extraction from classical proofs
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00110-5openalex-snapshot
The sequentially realizable functionals
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00047-xopenalex-snapshot
Typing untyped λ-terms, or reducibility strikes again!
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00048-6openalex-snapshot
Unary PCF is decidable
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00141-xopenalex-snapshot
The Girard–Reynolds isomorphism
inferred← citeshttps://doi.org/10.1017/9781316823187openalex-snapshot
Introduction to Coalgebra: Towards Mathematics of States and Observation
inferred← citeshttps://doi.org/10.1017/s0956796812000056openalex-snapshot
Proofs for free
inferred← citeshttps://doi.org/10.1017/s0956796812000251openalex-snapshot
A unified treatment of syntax with binders
inferred← citeshttps://doi.org/10.1017/s0960129522000263openalex-snapshot
Semantic analysis of normalisation by evaluation for typed lambda calculus
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1328897.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/331605.331611openalex-snapshot
From Algol to polymorphic linear lambda-calculus
inferred← citeshttps://doi.org/10.1145/571157.571161openalex-snapshot
Semantic analysis of normalisation by evaluation for typed lambda calculus
inferred← citeshttps://doi.org/10.2178/jsl/1067620188openalex-snapshot
Proof normalization modulo
inferred← citeshttps://doi.org/10.2307/421013openalex-snapshot
The Impact of the Lambda Calculus in Logic and Computer Science
inferred← citeshttps://doi.org/10.3390/electronics13204093openalex-snapshot
Advanced Security Auditing Methods for Solidity-Based Smart Contracts
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.