Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Prolog

Name: Anonymous 2014-06-09 0:59

And then Prolog.. holy SHIT. NO ONE UNDERSTOOD ANYTHING. It was four weeks of COMPLETE CHAOS. He wouldn't help anyone either. I don't even know if he knew Prolog. It was fucking stupid got it makes me angry thinking about it. Not one person was able to complete the "AI project" midterm.

Prolog seems like an interesting language. What kind of language is it? What it's purpose? What did you guys exactly do with prolog and what was that ``AI project'' about?

Name: Anonymous 2014-06-09 1:05

Prolog is for old women, are you a old women? My 80 years old grandmother knows prolog, this is the average age of all its userbase

some little lolies use prolog too but this is another story

Name: Anonymous 2014-06-09 1:18

cum

Name: Anonymous 2014-06-09 1:47

>>2
I disagree about the old women. Old women would most likely know COBOL exclusively, as it was popular among secretaries back when programming was thought of as menial.

Anyway, tell us more about the lolies.

Name: Anonymous 2014-06-09 2:09

>>4
You'll never go anywhere in life you fucking autistic loser.

Name: Anonymous 2014-06-09 2:16

>>5
Easy there, Yannick.

Name: Anonymous 2014-06-09 2:16

>>1
Why don't you just post in the thread, you fucking fuck

Name: Anonymous 2014-06-09 3:55

>>1

Paul Graham's On Lisp book implements Prolog in 100 lines as an example of macros usage. It is not easy to learn or efficient language for general programming, but does provide an alternate way to query SQL databases.

Name: Anonymous 2014-06-09 3:57

>>8

SICP includes Prolog implementation as an exercise.

Name: Anonymous 2014-06-09 5:32

?- [user].
meme(g, battlestations).
meme(hn, nodejs).
meme(prog, polecat).
meme(prog, egin).
^D

?- meme(prog, battlestations).
No

?- meme(prog, polecat)
Yes

?- meme(prog, X)
X = polecat
X = egin
Yes


It also has nice syntax for lists, that serves equally as cons and as car/cdr. Lists are used automatically in pattern-matching.

[Head | Tail]
[a, b, c, d]
[a, b | Tail]

Name: Alexander Dubček 2014-06-09 5:40

?- [user].
dubs(X):- 0 is X mod 11.
^D
%% user compiled, 1 lines read

?- dubs(11).
Yes

Name: Anonymous 2014-06-09 20:57

egin spengler

Name: Anonymous 2014-06-10 0:54

I wrote a Strong AI in prolog when I was five, but decided to erase my work and memories in order to save us all, or rather... delay our doom.

Name: Anonymous 2014-06-10 1:11

>>13

Shalom, Yudkowsky-sama!!!

Name: Anonymous 2014-06-10 8:34

Name: Anonymous 2014-06-10 9:43

>>15
How about mercury oniichan? ;-;

Name: Anonymous 2014-06-10 14:02

>>16
There is an mK definition of Scheme which will write programs for you given the desired relations in their output. It will write quines of any order, for example.

Don't change these.
Name: Email:
Entire Thread Thread List