Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
triska
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
42 ms
·
361.
▲
by
triska
7y ago
Yes! Stack-based abstract machines are often used because they allow compact code that is very easy to create and interpret. As another example, Pascal p-code (UCSD p-code) is also stack-based: https://en.wikipedia.org/wiki&
362.
▲
by
triska
7y ago
To get a glimpse of stack-oriented programming, I really like and recommend PostScript , because this also automatically introduces you to a widely used programming language with important practical applications, and it's also great f
363.
▲
by
triska
7y ago
As I see it, the key characteristic of stack-oriented programming is not that it "uses postfix notation". Rather, the key characteristic is that there is an important implicit feature available, namely the stack (or, as for ex
364.
▲
by
triska
7y ago
Regarding the following quote about type String = [Char]: “ This is not only a bad representation, it’s quite possibly the least efficient (non-contrived) representation of text data possible and has horrible performance in both time and sp
365.
▲
by
triska
7y ago
It's very interesting to see such an explicit endorsement of standardisation efforts, and also the comparison with other languages such as C++. The situation is also similar to that of Prolog, where many important language features — s
366.
▲
by
triska
7y ago
First of all, thank you Lars for running this invaluable service for so long! And second, regarding the question “Is it even useful for anybody any more?”: Definitely yes . I have often used news.gmane.org to selectively read for example e
367.
▲
by
triska
7y ago
Thank you very much for your kind words, and for your interest! Yes, absolutely: In fact, Prolog was designed for natural language processing and convenient interfacing. However, currently, all existing Prolog systems fall short for such
368.
▲
by
triska
7y ago
A few days ago, a commenter remarked that Prolog seems to be a good choice to solve combinatorial problems such as timetabling tasks. That's indeed the case! Prolog is an excellent choice for modeling combinatorial problems, and it is
369.
▲
Show HN: Constraint-Based School Timetabling with Prolog
(metalevel.at)
20 points
by
triska
7y ago
|
4 comments
370.
▲
by
triska
7y ago
I cannot speak for the entire public sector or the BRZ. However, Lisp has already played an important role in two projects I led, and it also plays an important role in the project I mentioned which is currently ongoing. Prolog is used for
371.
▲
by
triska
7y ago
This is really cool! Notably, the venue of this conference was the Bundesrechenzentrum (Austrian Federal Computing Center), abbreviated as BRZ, the strategic technology partner of the Austrian public sector where many IT applications and
372.
▲
by
triska
7y ago
These are excellent questions! And yes, there is! For example, I highly recommend the paper Rethinking set theory by Tom Leinster: https://arxiv.org/abs/1212.6543 It highlights Lawvere set theory. The paper won this
373.
▲
by
triska
7y ago
A very interesting discussion about this topic that also includes many examples and references is available on MathOverflow: What are some reasonable-sounding statements that are independent of ZFC? https://mathoverflow.net
374.
▲
by
triska
7y ago
The book Term Rewriting and All That by Baader and Nipkow includes a lot of code in ML, I highly recommend it. The code is available online: https://www21.in.tum.de/~nipkow/TRaAT/ The book also contains many use
375.
▲
by
triska
7y ago
To clarify: I mean that Prolog was under consideration to be used for what SPARQL was then developed, as a more readable and simpler query and also modeling language. Several researchers working in this area considered the development of SP
376.
▲
by
triska
7y ago
A good way to try Datalog is to use a state-of-the-art Prolog system that supports SLG resolution (tabling). SLG resolution is an evaluation strategy of Prolog programs that provides favourable termination properties compared to SLDNF res
377.
▲
by
triska
7y ago
That's a very justified question! In my opinion, Datalog or — more generally — Prolog is where many querying APIs will eventually arrive, because this syntax has many nice advantages: It is very convenient, expressive and readable, pro
378.
▲
Elxlog: Small pure Prolog intepreter/compiler in Elixir
(github.com)
2 points
by
triska
7y ago
|
0 comments
379.
▲
by
triska
7y ago
The way I see it, a key attraction of Prolog and logic programming languages in general is that different evaluation strategies are possible, and in fact also starting to be implemented in several systems to various degrees. For example,
380.
▲
by
triska
7y ago
When you say "evaluated", then this is a procedural aspect that depends on the concrete evaluation strategy that is being used. For example, we can evaluate logic programs top down, bottom up, using various forms of resolution etc
381.
▲
by
triska
7y ago
For example, in logic programming languages like Prolog and Mercury, you can write the goals of a rule, and also the clauses of a predicate, in any order you like while preserving the logical meaning of the code.
382.
▲
by
triska
7y ago
Yes, and it is a key characteristic of a skillful translator that such features are kept in the translation. This translation is very nice, but notice for example that the word "long" is itself now no longer long in the translat
383.
▲
by
triska
7y ago
I mean that Latin is the only language I know which provides this extreme flexibility of form, to match what you want to describe by means of the structure and features of the sentence itself. This flexbility is available in various degrees
384.
▲
by
triska
7y ago
In school, one of our teachers was also a priest, and he told us that his job once required him to travel to the (former) Soviet Union. His Russian colleague did not speak German, and he did not speak Russian. Latin was the only language in
385.
▲
by
triska
7y ago
Latin is the most powerful natural language I know. The reason is that the grammar is so developed that the word order is essentially arbitrary, and that, together with other grammatical features, gives rise to a method I have not seen so f
386.
▲
by
triska
7y ago
Very interesting, thank you for this writeup! Regarding the following considerations: "After a few seconds this program terminates which seems wrong. Why should a problem that has infinitely many solutions ever terminate? Shouldn’t it
387.
▲
by
triska
7y ago
One very interesting development in this direction is Web Prolog by Torbjörn Lager: https://github.com/Web-Prolog/swi-web-prolog/raw/master/book... Quoting from the introduction: "In particular,
388.
▲
by
triska
7y ago
One interesting aspect of this concrete example is that even though the two statements seem contradictory at first sight, there are in fact two assignments of truth values to statements so that no contradiction arises. For instance, using S
389.
▲
by
triska
7y ago
Very interesting, thank you for sharing this! Map colouring tasks such as shown in the article are indeed an excellent fit for Prolog. The key to efficient formulations of such combinatorial tasks is to avoid generating all possibilities b
390.
▲
by
triska
7y ago
In general, using any of the mentioned predicates (->)/2, (\+)/1 or !/0 in Prolog code destroys essential properties we expect from classical logic, and therefore complicates declarative reasoning about the code to such an
More ›