%  library(win_menu) compiled into win_menu 0.02 sec, 33 clauses
Welcome to SWI-Prolog (Multi-threaded, 64 bits, Version 6.4.0)
Copyright (c) 1990-2013 University of Amsterdam, VU Amsterdam
SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software,
and you are welcome to redistribute it under certain conditions.
Please visit http://www.swi-prolog.org for details.

For help, use ?- help(Topic). or ?- apropos(Word).

1 ?- consult('~/Documents/CSC366/Assignments/proglang.pro').
% c:/Users/joshu/Documents/CSC366/Assignments/proglang.pro compiled 0.00 sec, 10 clauses
true.

2 ?- language(pascal).
false.

3 ?- language(prolog).
true.

4 ?- language(X).
X = smalltalk .

5 ?- language(L).
L = smalltalk ;
L = lisp ;
L = prolog.

6 ?- language(Language), write(Language), nl, fail.
smalltalk
lisp
prolog
false.

7 ?- essence(lisp, DT, CF).
DT = lists,
CF = 'recursive fuctions'.

8 ?- essence(prolog, DT, _).
DT = relations.

9 ?- essence(prolog, _, CF).
CF = 'logical inferencing'.

10 ?- essence(L, objects,_).
L = smalltalk.

11 ?- history(lisp,I,_).
I = inventor('John McCarthy').

12 ?- history(lisp,inventor(Name),_).
Name = 'John McCarthy'.

13 ?- history(_,inventor(N),_), write(N), nl, fail.
Alan Kay
John McCarthy
Alan Colmeraur
false.

14 ?- halt.