The execution algorithm of mercury, an efficient purely declarative logic programming language

Cited In (45)

Turning Inductive into Equational Specifications
Automatic Generation of Test Inputs for Mercury
From Monomorphic to Polymorphic Well-Typings and Beyond
Improving precision of type analysis using non-discriminative union
Precise goal-independent abstract interpretation of constraint logic programs.
Region-based memory management for Mercury programs
Concolic Testing in CLP
A functional account of probabilistic programming with possible worlds. Declarative pearl
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
An overview of Ciao and its design philosophy
Transforming Boolean equalities into constraints
On Termination, Confluence and Consistent CHR-based Type Inference
Monadic constraint programming
Title not available (Why is that?)
Logic programming
Towards a Normal Form for Mercury Programs
\(\exists\)-Universal termination of logic programs
A framework for timed concurrent constraint programming with external functions
From Logic to Functional Logic Programs
Title not available (Why is that?)
Concolic testing in logic programming
VeriFly: On-the-fly Assertion Checking via Incrementality
The design of the zinc modelling language
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Flexible Search Framework for CHR
Fifty Years of Prolog and Beyond
Data type inference for logic programming
Proving semantic properties as first-order satisfiability
Representation sharing for Prolog
From High-Level Model to Branch-and-Price Solution in G12
MERLIN 2001. Proceedings of the workshop on mechanized reasoning about languages with variable binding (in connection with IJCAR 2001), Siena, Italy, June 18, 2001
Linearity and uniqueness: an entente cordiale
Towards Typed Prolog
Efficient description logic reasoning in Prolog: The DLog system
Online Bayesian inference for the parameters of PRISM programs
Functional Logic Programming: From Theory to Curry
Horn clauses as an intermediate representation for program analysis and transformation
Derivation of efficient logic programs by specialization and reduction of nondeterminism
Description and Optimization of Abstract Machines in a Dialect of Prolog
Algeo: an algebraic approach to reversibility
Type-based homeomorphic embedding for online termination

Uses Software

wamcc
Mercury
SICStus

This page was built for publication: The execution algorithm of mercury, an efficient purely declarative logic programming language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339846)