Mercury

swMATH8333MaRDI QIDQ20342

No author found.

Related Items (71)

From Logic to Functional Logic Programs ⋮ Unnamed Item ⋮ Transforming Boolean equalities into constraints ⋮ Propagating systems of dense linear integer constraints ⋮ Generalizing Def and Pos to Type Analysis ⋮ Turning Inductive into Equational Specifications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Offline specialisation in Prolog using a hand-written compiler generator ⋮ Unnamed Item ⋮ Data decomposition of Monte Carlo particle transport simulations via tally servers ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Unnamed Item ⋮ The integration of functions into logic programming: From theory to practice ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Precise goal-independent abstract interpretation of constraint logic programs. ⋮ 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 ⋮ An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy ⋮ Unnamed Item ⋮ Online Bayesian inference for the parameters of PRISM programs ⋮ Dantzig-Wolfe decomposition and branch-and-price solving in G12 ⋮ Unnamed Item ⋮ The execution algorithm of mercury, an efficient purely declarative logic programming language ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Concolic Testing in CLP ⋮ Unnamed Item ⋮ Region-based memory management for Mercury programs ⋮ The design of the zinc modelling language ⋮ Program Development in Computational Logic ⋮ Linear usage of state ⋮ Functional Logic Programming: From Theory to Curry ⋮ Logic Programming ⋮ Towards the uniform implementation of declarative languages ⋮ Unnamed Item ⋮ \(\exists\)-Universal termination of logic programs ⋮ Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ Inductive synthesis of recursive logic programs: achievements and prospects ⋮ Conjunctive partial deduction: foundations, control, algorithms, and experiments ⋮ Type-based homeomorphic embedding for online termination ⋮ Static Region Analysis for Mercury ⋮ Towards Region-Based Memory Management for Mercury Programs ⋮ 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 ⋮ Opium: an extendable trace analyzer for Prolog ⋮ The witness properties and the semantics of the Prolog cut ⋮ Logic program specialisation through partial deduction: Control issues ⋮ Using parametric set constraints for locating errors in CLP programs ⋮ Generic program monitoring by trace analysis ⋮ Verifying termination and error-freedom of logic programs with block declarations ⋮ Estimating the overlap between dependent computations for automatic parallelization ⋮ A three-valued semantics for logic programmers ⋮ Mercury$$^\mathrm{\textregistered }$$: A Software Based on Fuzzy Clustering for Computer-Assisted Composition ⋮ Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation ⋮ Towards a Normal Form for Mercury Programs ⋮ Towards Typed Prolog ⋮ Minimizing the overheads of dependent AND-parallelism ⋮ Algeo: an algebraic approach to reversibility ⋮ A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems ⋮ Static and dynamic slicing of constraint logic programs ⋮ A Framework for Timed Concurrent Constraint Programming with External Functions ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

This page was built for software: Mercury