2 citations · 2 across the 2 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2009★ 2 cited
Better Termination for Prolog with Constraints
Markus Triska, Ulrich Neumerkel, Jan Wielemaker
Termination properties of actual Prolog systems with constraints are fragile and difficult to analyse. The lack of the occurs-check, moded and overloaded arithmetical evaluation vi…
cs.PL2007
SWI-Prolog and the Web
Jan Wielemaker, Zhisheng Huang, Lourens van der Meij
Where Prolog is commonly seen as a component in a Web application that is either embedded or communicates using a proprietary protocol, we propose an architecture where Prolog comm…