*Result*: Domain-Theoretic Semantics for Functional Logic Programming
Title:
Domain-Theoretic Semantics for Functional Logic Programming
Authors:
Source:
Jones, E, Main, S S, Li, C, Marriott, J & Kavvos, G A 2026, 'Domain-Theoretic Semantics for Functional Logic Programming', Proceedings of the ACM on Programming Languages, vol. 10, no. POPL, 57, pp. 1641-1672. https://doi.org/10.1145/3776699
Publication Year:
2026
Collection:
University of Bristol: Bristol Reserach
Subject Terms:
Document Type:
*Academic Journal*
article in journal/newspaper
File Description:
application/pdf
Language:
English
Relation:
info:eu-repo/semantics/altIdentifier/hdl/https://hdl.handle.net/1983/3bdffb28-464f-4335-a77e-c3a47bb02332
DOI:
10.1145/3776699
Availability:
Rights:
info:eu-repo/semantics/openAccess ; http://creativecommons.org/licenses/by/4.0/
Accession Number:
edsbas.47D152C5
Database:
BASE
*Further Information*
*Functional Logic Programming (FLP) is a paradigm that extends higher-order functional programming with nondeterministic choice, logical variables, and equational constraints. Starting from the observation that these constructs can be presented as algebraic effects, we rationally reconstruct a core calculus for FLP that is based on call-by-push-value, and supports higher-order functions and recursion. We show how to execute its programs through an abstract machine that implements narrowing. Finally, we present a domain-theoretic semantics based on the lower powerdomain, which we prove to be sound, adequate, and fully abstract with respect to the machine. This leads to an exploration of the limitations of domain theory in modelling FLP.*