Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

GNU Prolog: Beyond Compiling Prolog to C

Daniel DiazContact Information and Philippe CodognetContact Information

(6)  CRI, bureau C1407, University of Paris 1, 90 rue de Tolbiac, 75013 Paris, France
(7)  LIP6, case 169, University of Paris 6, 8 rue du Capitaine Scott, 75015 Paris, France
Abstract
We describe in this paper the compilation scheme of the GNU Prolog system. This system is built on our previous experience of compiling Prolog to C in wamcc. The compilation scheme has been however redesigned to overcome drawbacks of the compilation to C. In particular, GNU-Prolog is based on a low-level mini-assembly platformindependent language that makes it possible to avoid the phase of compiling C code, and thus speeds up drastically compilation time. It also makes it possible to produce small stand alone executable files as the result of the compilation process. Interestingly, GNU Prolog is now compliant to the ISO standard and includes several extensions (constraint solving, OS interface, sockets, global variables, etc). The overall system is efficient and comparable in performances with commercial systems.

Contact Information Daniel Diaz
Email: diaz@univ-paris1.fr

Contact Information Philippe Codognet
Email: Philippe.Codognet@lip6.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Cotta, Carlos (2007) Local Search-based Hybrid Algorithms for Finding Golomb Rulers. Constraints 12(3)
    [CrossRef]
Remote Address: 38.107.191.105 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)