The execution algorithm of mercury, an efficient purely declarative logic programming language
From MaRDI portal
Publication:4339846
Recommendations
Cited in
(46)- Turning Inductive into Equational Specifications
- Automatic Generation of Test Inputs for Mercury
- From Monomorphic to Polymorphic Well-Typings and Beyond
- On termination, confluence and consistent CHR-based type inference
- 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
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
- An overview of Ciao and its design philosophy
- Transforming Boolean equalities into constraints
- Monadic constraint programming
- scientific article; zbMATH DE number 1497845 (Why is no real title available?)
- Towards a Normal Form for Mercury Programs
- Logic programming
- \(\exists\)-Universal termination of logic programs
- A framework for timed concurrent constraint programming with external functions
- From Logic to Functional Logic Programs
- scientific article; zbMATH DE number 7453101 (Why is no real title available?)
- Description and optimization of abstract machines in a dialect of Prolog
- The design of the zinc modelling language
- Concolic testing in logic programming
- VeriFly: On-the-fly Assertion Checking via Incrementality
- Concolic testing in CLP
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- scientific article; zbMATH DE number 1497826 (Why is no real title available?)
- scientific article; zbMATH DE number 1497834 (Why is no real title available?)
- scientific article; zbMATH DE number 1497843 (Why is no real title available?)
- A Flexible Search Framework for CHR
- Fifty Years of Prolog and Beyond
- Proving semantic properties as first-order satisfiability
- Representation sharing for Prolog
- Data type inference for logic programming
- 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
- Towards Typed Prolog
- Linearity and uniqueness: an entente cordiale
- 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
- scientific article; zbMATH DE number 2087569 (Why is no real title available?)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Horn clauses as an intermediate representation for program analysis and transformation
- Type-based homeomorphic embedding for online termination
- Algeo: an algebraic approach to reversibility
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)
