The execution algorithm of mercury, an efficient purely declarative logic programming language
From MaRDI portal
Publication:4339846
DOI10.1016/S0743-1066(96)00068-4zbMath0877.68015WikidataQ56057372 ScholiaQ56057372MaRDI QIDQ4339846
Thomas Oliver Conway, Fergus Henderson, Zoltan Somogyi
Publication date: 16 June 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (43)
From Logic to Functional Logic Programs ⋮ An overview of Ciao and its design philosophy ⋮ Transforming Boolean equalities into constraints ⋮ Turning Inductive into Equational Specifications ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ On Termination, Confluence and Consistent CHR-based Type Inference ⋮ Precise goal-independent abstract interpretation of constraint logic programs. ⋮ VeriFly: On-the-fly Assertion Checking via Incrementality ⋮ Fifty Years of Prolog and Beyond ⋮ Horn clauses as an intermediate representation for program analysis and transformation ⋮ Concolic testing in logic programming ⋮ Description and Optimization of Abstract Machines in a Dialect of Prolog ⋮ Data type inference for logic programming ⋮ Linearity and uniqueness: an entente cordiale ⋮ Online Bayesian inference for the parameters of PRISM programs ⋮ Dantzig-Wolfe decomposition and branch-and-price solving in G12 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From High-Level Model to Branch-and-Price Solution in G12 ⋮ Concolic Testing in CLP ⋮ Region-based memory management for Mercury programs ⋮ The design of the zinc modelling language ⋮ Functional Logic Programming: From Theory to Curry ⋮ \(\exists\)-Universal termination of logic programs ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ Improving precision of type analysis using non-discriminative union ⋮ Type-based homeomorphic embedding for online termination ⋮ Proving semantic properties as first-order satisfiability ⋮ A Flexible Search Framework for CHR ⋮ Automatic Generation of Test Inputs for Mercury ⋮ From Monomorphic to Polymorphic Well-Typings and Beyond ⋮ Efficient description logic reasoning in Prolog: The DLog system ⋮ Monadic constraint programming ⋮ Representation sharing for Prolog ⋮ Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation ⋮ Towards a Normal Form for Mercury Programs ⋮ Towards Typed Prolog ⋮ Algeo: an algebraic approach to reversibility ⋮ A Framework for Timed Concurrent Constraint Programming with External Functions ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism
Uses Software
This page was built for publication: The execution algorithm of mercury, an efficient purely declarative logic programming language
