SICStus

SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for revisiting the main language and design decisions, and try to distill some lessons. SICStus Prolog was conceived in a context of multiple, conflicting Prolog dialect camps and a fledgling standardization effort. We reflect on the impact of this effort and role model implementations on our development. After summarizing the development history, we give a guided tour of the system anatomy, exposing some designs that were not published before. We give an overview of our new interactive development environment, and describe a sample of key applications. Finally, we try to identify key good and not so good design decisions.


References in zbMATH (referenced in 46 articles )

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

1 2 3 next

  1. Beldiceanu, Nicolas; Carlsson, Mats; Douence, Rémi; Simonis, Helmut: Using finite transducers for describing and synthesising structural time-series constraints (2016)
  2. Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nicolas: Synchronized sweep algorithms for scalable scheduling constraints (2015)
  3. Schrijvers, Tom; Demoen, Bart; Triska, Markus; Desouter, Benoit: Tor: modular search with hookable disjunction (2014)
  4. Beldiceanu, Nicolas; Carlsson, Mats; Flener, Pierre; Pearson, Justin: On matrices, automata, and double counting in constraint programming (2013)
  5. Lopes, Ricardo; Costa, Vítor Santos; Silva, Fernando: A design and implementation of the extended Andorra model (2012)
  6. Tarau, Paul: The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines (2012)
  7. Cheng, Kenil C.K.; Yap, Roland H.C.: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (2010)
  8. Fages, François; Martin, Julien: From rules to constraint programs with the Rules2CP modelling language (2009)
  9. Gras, Daniel Cabeza; Hermenegildo, Manuel V.: Non-strict independence-based program parallelization using sharing and freeness information (2009)
  10. Beldiceanu, Nicolas; Carlsson, Mats; Thiel, Sven: Sweep synchronization as a global propagation mechanism (2006)
  11. Casas, Amadeo; Cabeza, Daniel; Hermenegildo, Manuel V.: A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems (2006)
  12. Cheng, Kenil C.K.; Yap, Roland H.C.: Applying ad-hoc global constraints with the case constraint to still-life (2006)
  13. Sakellariou, Ilias; Vlahavas, Ioannis; Futo, Ivan; Pasztor, Zoltan; Szeredi, Janos: Communicating sequential processes for distributed constraint satisfaction (2006)
  14. Beldiceanu, Nicolas; Carlsson, Mats; Debruyne, Romuald; Petit, Thierry: Reformulation of global constraints based on constraints checkers (2005)
  15. Beldiceanu, Nicolas; Carlsson, Mats; Rampon, Jean-Xavier; Truchet, Charlotte: Graph invariants as necessary conditions for global constraints (2005)
  16. Rocha, Ricardo; Silva, Fernando; Costa, Vítor Santos: On applying or-parallelism and tabling to logic programs (2005)
  17. Beldiceanu, Nicolas; Carlsson, Mats; Petit, Thierry: Deriving filtering algorithms from constraint checkers (2004)
  18. Ribeiro, Cristina; Carravilla, Maria Antónia: A global constraint for nesting problems (2004)
  19. Schulte, Christian: Programming constraint services. High-level programming of standard and new constraint services (2002)
  20. Thorsteinsson, Erlendur S.; Ottosson, Greger: Linear relaxations and reduced-Cost based propagation of continuous variable subscripts (2002)

1 2 3 next