On the public citation graph

Integrating logic and functional programming

https://doi.org/10.1007/bf01806313
0 signed · 68 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.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-15975-4_29openalex-snapshot
The categorical abstract machine
inferredcites →https://doi.org/10.1007/3-540-15976-2_16openalex-snapshot
Handling function definitions through innermost superposition and rewriting
inferredcites →https://doi.org/10.1007/3-540-15976-2_18openalex-snapshot
Combining unification algorithms for confined regular equational theories
inferredcites →https://doi.org/10.1007/3-540-15976-2_7openalex-snapshot
NARROWER: a new algorithm for unification and its application to Logic Programming
inferredcites →https://doi.org/10.1007/3-540-16492-8_79openalex-snapshot
Parallel logic programming languages
inferredcites →https://doi.org/10.1007/3-540-16492-8_94openalex-snapshot
Higher-order logic programming
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_24openalex-snapshot
Recursion Equations as a Programming Language
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot
Rewrite methods for clausal and non-clausal theorem proving
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
inferredcites →https://doi.org/10.1016/0167-739x(87)90015-xopenalex-snapshot
Logic programming functions, relations and equations
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/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(84)90125-7openalex-snapshot
Characterizing specification languages which admit initial semantics
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50008-0openalex-snapshot
Completion and Its Applications
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50014-6openalex-snapshot
Lazy Unification Algorithms for Canonical Rewrite Systems
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/9781009498968.017openalex-snapshot
Term Rewriting Systems
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1109/sfcs.1980.11openalex-snapshot
An improved algorithm for computing with equations
inferredcites →https://doi.org/10.1137/0213047openalex-snapshot
n -Rational Algebras I. Basic Properties and Free Algebras
inferredcites →https://doi.org/10.1137/0213048openalex-snapshot
n -Rational Algebras II. Varieties and Logic of inequalities
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/512644.512663openalex-snapshot
Equational logic programming
inferredcites →https://doi.org/10.1145/512644.512668openalex-snapshot
Annotations for distributed programming in logic
inferredcites →https://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types

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-19074-0_45openalex-snapshot
Optimization in a logic based language for knowledge and data intensive applications
inferred← citeshttps://doi.org/10.1007/3-540-45945-6openalex-snapshot
Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
inferred← citeshttps://doi.org/10.1007/3-540-53557-8_21openalex-snapshot
Database support for knowledge representation?
inferred← citeshttps://doi.org/10.1007/3-540-54141-1_11openalex-snapshot
Towards database application systems: Types, kinds and other open invitations
inferred← citeshttps://doi.org/10.1007/3-540-54141-1_2openalex-snapshot
A glimpse of paradise
inferred← citeshttps://doi.org/10.1007/3-540-54141-1_4openalex-snapshot
An overview of life
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_104openalex-snapshot
Towards a meaning of LIFE
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_6openalex-snapshot
Logic programming with functions over order-sorted feature terms
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_37openalex-snapshot
Entailment and disentailment of order-sorted feature constraints
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_14openalex-snapshot
On the completeness of narrowing as the operational semantics of functional logic programming
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_62openalex-snapshot
Cut formulae and logic programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_2openalex-snapshot
Introducing Constraint Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_24openalex-snapshot
Residuation and Guarded Rules for Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-39451-8_38openalex-snapshot
A Flexible Meta-solver Framework for Constraint Solver Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-642-59623-0_16openalex-snapshot
Bulk Types: Built-in or Add-On?
inferred← citeshttps://doi.org/10.1007/bf01178581openalex-snapshot
The calculus of context relations
inferred← citeshttps://doi.org/10.1007/bfb0017447openalex-snapshot
Ordering Constraints over Feature Trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00188-oopenalex-snapshot
A complete and recursive feature theory
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90207-0openalex-snapshot
MLOG: a strongly typed confluent functional language with logical variables
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90209-7openalex-snapshot
A feature constraint system for logic programming with entailment
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90043-gopenalex-snapshot
Towards a meaning of life
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90044-2openalex-snapshot
Records for logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00033-gopenalex-snapshot
A complete axiomatization of a theory with feature and arity constraints
inferred← citeshttps://doi.org/10.1016/s1045-926x(05)80004-7openalex-snapshot
Unification-based grammars and tabular parsing for graphical languages
inferred← citeshttps://doi.org/10.1017/s1471068403001741openalex-snapshot
Logic programming in the context of multiparadigm programming: the Oz experience
inferred← citeshttps://doi.org/10.1017/s1471068406002833openalex-snapshot
Integration of declarative and constraint programming
inferred← citeshttps://doi.org/10.1145/1622123.1622135openalex-snapshot
Constraint solving in common Lisp
inferred← citeshttps://doi.org/10.1145/183432.183526openalex-snapshot
Functions as passive constraints in LIFE
inferred← citeshttps://doi.org/10.14279/depositonce-2848openalex-snapshot
Efficient Constraint Solving in Dynamic Languages
inferred← citeshttps://doi.org/10.15760/etd.2658openalex-snapshot
TeaBag: A Debugger for Curry
inferred← citeshttps://doi.org/10.3115/981574.981600openalex-snapshot
A complete and recursive feature theory
inferred← citeshttps://doi.org/10.3115/981574.981603openalex-snapshot
F-PATR
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0208029openalex-snapshot
Logic programming in the context of multiparadigm programming: the Oz experience
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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.