On the public citation graph

A semantic framework for functional logic programming with algebraic polymorphic types

https://doi.org/10.1007/bfb0030618
0 signed · 26 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-50667-5_58openalex-snapshot
Logic programming with polymorphically order-sorted types
inferredcites →https://doi.org/10.1007/3-540-58601-6_107openalex-snapshot
Set constraints and set-based analysis
inferredcites →https://doi.org/10.1007/3-540-61055-3_35openalex-snapshot
A rewriting logic for declarative programming
inferredcites →https://doi.org/10.1007/3-540-61735-3_20openalex-snapshot
Algebraic semantics for functional logic programming with polymorphic order-sorted types
inferredcites →https://doi.org/10.1007/bf00267044openalex-snapshot
On the algebraic specification of infinite objects — ordered and continuous models of algebraic types
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0026832openalex-snapshot
Minimal set unification
inferredcites →https://doi.org/10.1016/0022-0000(91)90009-topenalex-snapshot
Kernel-LEAF: A logic plus functional language
inferredcites →https://doi.org/10.1016/0743-1066(92)90024-wopenalex-snapshot
Logic programming with functions and predicates: The language Babel
inferredcites →https://doi.org/10.1016/0743-1066(92)90026-yopenalex-snapshot
Nondeterministic algebraic specifications and nonconfluent term rewriting
inferredcites →https://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.7551/mitpress/2087.003.0017openalex-snapshot
A Logical Theory of Concurrent Objects and Its Realization in the Maude Language

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_9openalex-snapshot
Functional Plus Logic Programming with Built-In and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/10705424_1openalex-snapshot
Semantics and Types in Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/10705424_6openalex-snapshot
A Functional-Logic Perspective of Parsing
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_19openalex-snapshot
TOY: A Multiparadigm Declarative System
inferred← citeshttps://doi.org/10.1007/978-3-030-16202-3openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_5openalex-snapshot
Multi-paradigm Declarative Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_6openalex-snapshot
Functional Logic Programming: From Theory to Curry
inferred← citeshttps://doi.org/10.1007/bfb0056631openalex-snapshot
Embedding multiset constraints into a lazy functional logic language
inferred← citeshttps://doi.org/10.1007/s10990-007-9002-4openalex-snapshot
A new generic scheme for functional logic programming with constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.030openalex-snapshot
Constraint Functional Logic Programming Revisited
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10029-8openalex-snapshot
An approach to declarative programming based on a rewriting logic
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404050openalex-snapshot
A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types
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.