On the public citation graph

Controlling search in declarative programs

0 signed · 46 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-57186-8_79openalex-snapshot

A demand driven computation strategy for lazy narrowing

inferredcites →https://doi.org/10.1007/3-540-61630-6_17openalex-snapshot

The Oz Programming Model

inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/bfb0017464openalex-snapshot

Programming constraint inference engines

inferredcites →https://doi.org/10.1007/bfb0056627openalex-snapshot

Controlling search in declarative programs

inferredcites →https://doi.org/10.1016/0304-3975(94)00225-8openalex-snapshot

Dynamic detection of determinism in functional logic languages

inferredcites →https://doi.org/10.1016/0743-1066(95)00037-kopenalex-snapshot

Scoping constructs in logic programming: Implementation problems and their solution

inferredcites →https://doi.org/10.1016/s0096-0551(97)00010-6openalex-snapshot

Lazy narrowing with simplification

inferredcites →https://doi.org/10.1093/comjnl/32.2.98openalex-snapshot

Why Functional Programming Matters

inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot

Report on the programming language Haskell

inferredcites →https://doi.org/10.1145/174675.177899openalex-snapshot

A needed narrowing strategy

inferredcites →https://doi.org/10.1145/262009.262011openalex-snapshot

How to declare an imperative

inferredcites →https://doi.org/10.1145/263699.263710openalex-snapshot

A unified computation model for functional and logic programming

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_11openalex-snapshot

Distributed Programming in a Multi-Paradigm Declarative Language

inferred← citeshttps://doi.org/10.1007/10705424_7openalex-snapshot

Implementing Encapsulated Search for a Lazy Functional Logic Language

inferred← citeshttps://doi.org/10.1007/10720084_12openalex-snapshot

Compiling Multi-paradigm Declarative Programs into Prolog

inferred← citeshttps://doi.org/10.1007/11431664_7openalex-snapshot

A Virtual Machine for Functional Logic Computations

inferred← citeshttps://doi.org/10.1007/11562931_21openalex-snapshot

Nondeterminism Analysis of Functional Logic Programs

inferred← citeshttps://doi.org/10.1007/11680093_2openalex-snapshot

Declarative Programming with Function Patterns

inferred← citeshttps://doi.org/10.1007/3-540-45241-9_6openalex-snapshot

High-Level Server Side Web Scripting in Curry

inferred← citeshttps://doi.org/10.1007/3-540-45788-7_4openalex-snapshot

Functional Logic Design Patterns

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-46584-7_4openalex-snapshot

A Functional Logic Programming Approach to Graphical User Interfaces

inferred← citeshttps://doi.org/10.1007/3-540-49481-2_23openalex-snapshot

Salsa: A Language for Search Algorithms

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-540-92243-8_2openalex-snapshot

A Flexible Search Framework for CHR

inferred← citeshttps://doi.org/10.1007/978-3-642-22531-4_2openalex-snapshot

New Functional Logic Design Patterns

inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_4openalex-snapshot

A Declarative Embedding of XQuery in a Functional-Logic Language

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.1016/j.entcs.2007.01.002openalex-snapshot

Reporting Failures in Functional Logic Programs

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80697-2openalex-snapshot

Failure and Equality in Functional Logic Programming1 1Work partially supported by the Spanish project TIC2002-01167 ‘MELODIAS’

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80785-0openalex-snapshot

Declarative Debugging for Encapsulated Search

inferred← citeshttps://doi.org/10.1017/s0956796813000245openalex-snapshot

Contextual equivalence for inductive definitions with binders in higher order typed functional programming

inferred← citeshttps://doi.org/10.1023/a:1020565317875openalex-snapshot

SALSA: A Language for Search Algorithms

inferred← citeshttps://doi.org/10.1093/logcom/12.5.747openalex-snapshot

Lazy List Comprehension in Logic Programming

inferred← citeshttps://doi.org/10.1145/1599410.1599420openalex-snapshot

Set functions for functional logic programming

inferred← citeshttps://doi.org/10.1145/2505879.2505896openalex-snapshot

A semantics for weakly encapsulated search in functional logic programs

inferred← citeshttps://doi.org/10.1145/3236950.3236957openalex-snapshot

Verifying Fail-Free Declarative Programs

inferred← citeshttps://doi.org/10.1145/351268.351292openalex-snapshot

Type-based nondeterminism checking in functional logic programs

inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot

Domain-Theoretic Semantics for Functional Logic Programming

inferred← citeshttps://doi.org/10.1145/773184.773206openalex-snapshot

An implementation of narrowing strategies

inferred← citeshttps://doi.org/10.1145/888251.888264openalex-snapshot

Simplification and termination of strategies in rule-based languages

inferred← citeshttps://doi.org/10.48456/tr-772openalex-snapshot

An executable meta-language for inductive definitions with binders

inferred← citeshttps://doi.org/10.70675/ba22234cza55fz4daazb100z1881baca8dcdopenalex-snapshot

Spacetime programming : a synchronous language for constraint search

showing the first 31 of 32 · page through all 32

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.