On the public citation graph
A logic programming language with lambda-abstraction, function variables, and simple unification
0 signed · 128 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-51081-8_104openalex-snapshot
Higher-order unification with dependent function types
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(76)90021-9openalex-snapshot
Mechanizing ω-order type theory through unification
inferredcites →https://doi.org/10.1016/0304-3975(79)90006-9openalex-snapshot
Intuitionistic propositional logic is polynomial-space complete
inferredcites →https://doi.org/10.1016/0304-3975(81)90040-2openalex-snapshot
The undecidability of the second-order unification problem
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/0743-1066(89)90031-9openalex-snapshot
A logical analysis of modules in logic programming
inferredcites →https://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/s0747-7171(89)80023-9openalex-snapshot
Higher-order unification revisited: Complete sets of transformations
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.1991.151632openalex-snapshot
Unification and anti-unification in the calculus of constructions
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/91556.91682openalex-snapshot
A representation of Lambda terms suitable for operations on their intensions
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
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.1999.2837openalex-snapshot
Higher Order Unification via Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/10721975_4openalex-snapshot
Termination and Confluence of Higher-Order Rewrite Systems
inferred← citeshttps://doi.org/10.1007/11539452_7openalex-snapshot
Model Checking for π-Calculus Using Proof Search
inferred← citeshttps://doi.org/10.1007/11601548_14openalex-snapshot
Higher-Order Rewriting: Framework, Confluence and Termination
inferred← citeshttps://doi.org/10.1007/11805618_29openalex-snapshot
Higher-Order Orderings for Normal Rewriting
inferred← citeshttps://doi.org/10.1007/11921240_14openalex-snapshot
Capture-Avoiding Substitution as a Nominal Algebra
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_10openalex-snapshot
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions
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-44957-4_6openalex-snapshot
Logic Program Synthesis in a Higher-Order Setting
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_7openalex-snapshot
Combining Pattern E-Unification Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_156openalex-snapshot
Reduction and unification in Lambda calculi with subtypes
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_152openalex-snapshot
Our LIPS are sealed: Interfacing functional and logic programming systems
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-58156-1_42openalex-snapshot
Representing proof transformations for program optimization
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_68openalex-snapshot
Pi: An interactive derivation editor for the calculus of partial inductive definitions
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_13openalex-snapshot
Comparing combinatory reduction systems and higher-order rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_9openalex-snapshot
Compilation of Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_66openalex-snapshot
A restricted form of higher-order rewriting applied to an HDL semantics
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_5openalex-snapshot
Efficient resource management for linear logic proof search
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_26openalex-snapshot
Development closed critical pairs
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_47openalex-snapshot
Higher-order superposition for dependent types
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_46openalex-snapshot
Inductive logic programming beyond logical implication
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_56openalex-snapshot
Higher-order proof by consistency
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_24openalex-snapshot
Higher-Ranked Annotation Polymorphic Dependency Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_2openalex-snapshot
Free Monads, Intrinsic Scoping, and Higher-Order Preunification
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_38openalex-snapshot
A Library of Anti-unification Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_19openalex-snapshot
ProofScript: Proof Scripting for the Masses
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-73147-4_4openalex-snapshot
Computability Closure: Ten Years Later
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_13openalex-snapshot
On the Relation between Sized-Types Based Termination and Semantic Labelling
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_13openalex-snapshot
Extracting the Essence of Distillation
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_12openalex-snapshot
Proof-Theoretic and Higher-Order Extensions of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_29openalex-snapshot
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
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-3-642-79361-5_1openalex-snapshot
Program Development by Proof Transformation
inferred← citeshttps://doi.org/10.1007/978-94-011-4231-1_7openalex-snapshot
How to Glue a Donkey to an F-Structure: Porting a ‘Dynamic’ Meaning Representation Language into LFG’s Linear Logic Glue-Language Semantics
inferred← citeshttps://doi.org/10.1007/bf00244461openalex-snapshot
Middle-out reasoning for synthesis and induction
inferred← citeshttps://doi.org/10.1007/bf00993253openalex-snapshot
Higher-order and modal logic as a framework for explanation-based generalization
inferred← citeshttps://doi.org/10.1007/bf03037499openalex-snapshot
Predicate abstractions in higher-order logic programming
inferred← citeshttps://doi.org/10.1007/bfb0013609openalex-snapshot
Implementing λ-calculus reduction strategies in extended logic programming languages
inferred← citeshttps://doi.org/10.1007/bfb0016848openalex-snapshot
Higher order disunification: Some decidable cases
inferred← citeshttps://doi.org/10.1007/bfb0016859openalex-snapshot
Higher order conditional rewriting and narrowing
inferred← citeshttps://doi.org/10.1007/bfb0017445openalex-snapshot
AC-unification of higher-order patterns
inferred← citeshttps://doi.org/10.1007/bfb0018435openalex-snapshot
Semantic interpretation as higher-order deduction
inferred← citeshttps://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferred← citeshttps://doi.org/10.1007/bfb0038696openalex-snapshot
Extensions to logic programming motivated by the construction of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bfb0054250openalex-snapshot
About the confluence of equational pattern rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0105418openalex-snapshot
Higher-order annotated terms for proof search
inferred← citeshttps://doi.org/10.1007/s00165-007-0056-1openalex-snapshot
Capture-avoiding substitution as a nominal algebra
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90240-topenalex-snapshot
A theory of binding structures and applications to rewriting
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferred← citeshttps://doi.org/10.1016/j.ic.2010.03.002openalex-snapshot
Abstract deduction and inferential models for type theory
inferred← citeshttps://doi.org/10.1016/j.jal.2012.07.007openalex-snapshot
Cut elimination for a logic with induction and co-induction
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.019openalex-snapshot
Normalisation for higher-order calculi with explicit substitutions
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00347-9openalex-snapshot
Inductive-data-type systems
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10038-9openalex-snapshot
A pragmatic reconstruction of λProlog
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80674-1openalex-snapshot
Translating Combinatory Reduction Systems into the Rewriting Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82526-5openalex-snapshot
Rewriting Calculus with(out) Types
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1023/a:1005394619746openalex-snapshot
Higher Order Unification and the Interpretation of Focus
inferred← citeshttps://doi.org/10.1023/a:1008224124336openalex-snapshot
Quantifiers, Anaphora, and Intensionality
inferred← citeshttps://doi.org/10.1023/a:1009868906501openalex-snapshot
A Methodological View of Constraint Solving
inferred← citeshttps://doi.org/10.1023/a:1022676712939openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
inferred← citeshttps://doi.org/10.1093/jigpal/9.3.377openalex-snapshot
The rewriting calculus - part II
inferred← citeshttps://doi.org/10.1109/access.2021.3112903openalex-snapshot
Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting
inferred← citeshttps://doi.org/10.1109/lics.1991.151632openalex-snapshot
Unification and anti-unification in the calculus of constructions
inferred← citeshttps://doi.org/10.1109/lics.1993.287599openalex-snapshot
Functional unification of higher-order patterns
inferred← citeshttps://doi.org/10.1109/lics.1997.614967openalex-snapshot
Linear higher-order pre-unification
inferred← citeshttps://doi.org/10.1111/an.1960.1.5.3.3openalex-snapshot
Australian National University
inferred← citeshttps://doi.org/10.1145/1614431.1614437openalex-snapshot
Higher-order term indexing using substitution trees
inferred← citeshttps://doi.org/10.1145/3167093openalex-snapshot
A two-level logic perspective on (simultaneous) substitutions
inferred← citeshttps://doi.org/10.1145/3571234openalex-snapshot
Top-Down Synthesis for Library Learning
inferred← citeshttps://doi.org/10.1145/3779031.3779093openalex-snapshot
A Lambda-Superposition Tactic for Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/937555.937559openalex-snapshot
Higher-order pattern complement and the strict λ-calculus
inferred← citeshttps://doi.org/10.2197/ipsjtrans.4.114openalex-snapshot
Argument Filterings and Usable Rules in Higher-order Rewrite Systems
inferred← citeshttps://doi.org/10.22028/d291-25891openalex-snapshot
A mechanization of sorted higher-order logic based on the resolution principle
inferred← citeshttps://doi.org/10.29007/9x4copenalex-snapshot
Efficiency of a good but not linear nominal unification algorithm
inferred← citeshttps://doi.org/10.3115/976744.976753openalex-snapshot
A strategy for dynamic interpretation
inferred← citeshttps://doi.org/10.3115/976909.979636openalex-snapshot
Negative polarity licensing at the syntax-semantics interface
inferred← citeshttps://doi.org/10.3115/981658.981687openalex-snapshot
Using higher-order logic programming for semantic interpretation of coordinate constructs
inferred← citeshttps://doi.org/10.46298/dmtcs.270openalex-snapshot
Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories
inferred← citeshttps://doi.org/10.48550/arxiv.cmp-lg/9404009openalex-snapshot
A Deductive Account of Quantification in LFG
inferred← citeshttps://doi.org/10.70675/6dd42e6cz0e58z4220zb87fzf5497ce93ca1openalex-snapshot
Mécanismes Orientés-Objets pour l'Interopérabilité entre Systèmes de Preuve
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.