On the public citation graph

A logic programming approach to implementing higher-Order term rewriting

https://doi.org/10.1007/bfb0013606
0 signed · 35 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferredcites →https://doi.org/10.1016/0167-6423(89)90038-5openalex-snapshot
Equational reasoning in Isabelle
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(91)90037-3openalex-snapshot
Polymorphic rewriting conserves algebraic strong normalization
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/cbo9780511569807.010openalex-snapshot
Encoding dependent types in an intuitionistic logic
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
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.1991.151658openalex-snapshot
Higher-order critical pairs
inferredcites →https://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferredcites →https://doi.org/10.1145/53990.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.48456/tr-68openalex-snapshot
HOL A machine oriented formulation of higher order logic

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-44755-5_14openalex-snapshot
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
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-60983-0_13openalex-snapshot
Higher Order Babel: Language and implementation
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferred← citeshttps://doi.org/10.1007/bfb0014049openalex-snapshot
Higher-order abstract syntax in Coq
inferred← citeshttps://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferred← citeshttps://doi.org/10.1007/bfb0054254openalex-snapshot
System description: Proof planning in higher-order logic with λClam
inferred← citeshttps://doi.org/10.1007/bfb0055141openalex-snapshot
Free variables and subexpressions in higher-order meta logic
inferred← citeshttps://doi.org/10.1007/bfb0105418openalex-snapshot
Higher-order annotated terms for proof search
inferred← citeshttps://doi.org/10.1007/s10817-010-9177-yopenalex-snapshot
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.011openalex-snapshot
A survey of strategies in rule-based program transformation systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00270-1openalex-snapshot
A Survey of Rewriting Strategies in Program Transformation Systems
inferred← citeshttps://doi.org/10.1090/mcom/3889openalex-snapshot
A Prolog assisted search for new simple Lie algebras
inferred← citeshttps://doi.org/10.1145/571157.571171openalex-snapshot
Transforming the .NET intermediate language using path logic programming
inferred← citeshttps://doi.org/10.1145/941566.941568openalex-snapshot
Term rewriting with traversal functions
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.12openalex-snapshot
A Functional Logic Language Based on Higher Order Narrowing
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.