On the public citation graph

A prological definition of HASL a purely functional language with unification based conditional binding expressions

https://doi.org/10.1007/bf03037050
0 signed · 21 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.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1002/spe.4380100203openalex-snapshot
Logic programming and compiler writing
inferredcites →https://doi.org/10.1007/bfb0031371openalex-snapshot
Metamorphosis grammars
inferredcites →https://doi.org/10.1016/0004-3702(80)90003-xopenalex-snapshot
Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
inferredcites →https://doi.org/10.1145/800068.802136openalex-snapshot
How to define a language using PROLOG
inferredcites →https://doi.org/10.1145/800168.811543openalex-snapshot
A lazy evaluator
inferredcites →https://doi.org/10.1145/800223.806766openalex-snapshot
The semantic elegance of applicative languages

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-15976-2_16openalex-snapshot
Handling function definitions through innermost superposition and rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18420-1_67openalex-snapshot
Implementing logical variables on a graph reduction architecture
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_98openalex-snapshot
FPL : Functional plus logic programming an integration of the FP and Prolog languages
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_6openalex-snapshot
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_10openalex-snapshot
Parallelism and Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_11openalex-snapshot
Concurrent Prolog
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_3openalex-snapshot
Unification — Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_7openalex-snapshot
Alternatives to Prolog as a Logic Programming Language
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
inferred← citeshttps://doi.org/10.1051/ita/1988220302711openalex-snapshot
Logic and functional programming by retractions
inferred← citeshttps://doi.org/10.1109/tencon.1989.176877openalex-snapshot
Logic programming implementation of functional programming languages
inferred← citeshttps://doi.org/10.1145/146585.146624openalex-snapshot
Efficient dataflow analysis of logic programs
inferred← citeshttps://doi.org/10.1145/318593.318657openalex-snapshot
Functional programing and the logical variable
inferred← citeshttps://doi.org/10.1145/319838.319873openalex-snapshot
Equations, sets, and reduction semantics for functional and logic programming
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.