Mercury is a logic/functional programming language which combines the clarity and expressiveness of declarative programming with advanced static analysis and error detection features. Its highly optimized execution algorithm delivers efficiency far in excess of existing logic programming systems, and close to conventional programming systems. Mercury addresses the problems of large-scale program development, allowing modularity, separate compilation, and numerous optimization/time trade-offs.

References in zbMATH (referenced in 65 articles )

Showing results 1 to 20 of 65.
Sorted by year (citations)

1 2 3 4 next

  1. Lucas, Salvador: Proving semantic properties as first-order satisfiability (2019)
  2. Antoy, Sergio; Hanus, Michael: Transforming Boolean equalities into constraints (2017)
  3. Morales, José F.; Carro, Manuel; Hermenegildo, Manuel: Description and optimization of abstract machines in a dialect of Prolog (2016)
  4. Gange, Graeme; Navas, Jorge A.; Schachte, Peter; Søndergaard, Harald; Stuckey, Peter J.: Horn clauses as an intermediate representation for program analysis and transformation (2015)
  5. Mesnard, Fred; Payet, Étienne; Vidal, Germán: Concolic testing in logic programming (2015)
  6. Møgelberg, Rasmus Ejlers; Staton, Sam: Linear usage of state (2014)
  7. Hanus, Michael: Functional logic programming: from theory to Curry (2013)
  8. Phan, Quan; Janssens, Gerda; Somogyi, Zoltan: Region-based memory management for Mercury programs (2013)
  9. Romano, Paul K.; Siegel, Andrew R.; Forget, Benoit; Smith, Kord: Data decomposition of Monte Carlo particle transport simulations via tally servers (2013)
  10. Cussens, James: Online Bayesian inference for the parameters of PRISM programs (2012)
  11. Bone, Paul; Somogyi, Zoltan; Schachte, Peter: Estimating the overlap between dependent computations for automatic parallelization (2011)
  12. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  13. Wang, Peter; Somogyi, Zoltan: Minimizing the overheads of dependent AND-parallelism (2011)
  14. Lopez-Garcia, Pedro; Bueno, Francisco; Hermenegildo, Manuel: Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses (2010)
  15. Albert, Elvira; Gallagher, John; Gómez-Zamalloa, Miguel; Puebla, Germán: Type-based homeomorphic embedding for online termination (2009)
  16. Berghofer, Stefan; Bulwahn, Lukas; Haftmann, Florian: Turning inductive into equational specifications (2009)
  17. Degrave, François; Schrijvers, Tom; Vanhoof, Wim: Automatic generation of test inputs for Mercury (2009)
  18. Schrijvers, Tom; Bruynooghe, Maurice; Gallagher, John P.: From monomorphic to polymorphic well-typings and beyond (2009)
  19. Albert, Elvira; Gallagher, John; Gómez-Zamalloa, Miguel; Puebla, Germán: Type-based homeomorphic embedding and its applications to online partial evaluation (2008)
  20. Degrave, François; Vanhoof, Wim: Towards a normal form for Mercury programs (2008)

1 2 3 4 next