A peculiar book list for the adventurous and free-spirited on which to build a solid base for their future software adventures.

A peculiar book list for the adventurous and free-spirited on which to build a solid base for their future software adventures.

A peculiar book list for the adventurous and free-spirited on which to build a solid base for their future software adventures.

Twelf is a language used to specify, implement, and prove properties of deductive systems such as programming languages and logics

Jag påstod inte att du sopade frågan under mattan. Du tog ju upp den! Jag tycker bara inte svaret är tillräckligt.

Tack för att du ger mig ett tillfälle att förtydliga strukturen i min essä här.

A quick and dirty ref. card for Clojure’s core logic

It cannot find its own problems; it cannot feed itself. … This, however, is not a defect in a machine; we do not want it to do its own business, but ours.

When you write a module in C’Dent, you can use it in a dozen different programming languages. For instance, you could write a module in Python and use it in JavaScript, or you could write a module in JavaScript and use it in Perl 6, Ruby or Java.

What a trip.

This is of limited use since it’s for logic, not for API stuff, and most apps write their own logic instead of relying on modules for logic, but I’ll have to try to remember that this exists for things that do rely on logic.

One example that does come to mind is an infix expression parser library that takes strings as input and returns numbers. Something like that could work with C’Dent.

Under “next steps” it says:

Add variables and assignments

Conclusion: completely useless for now without further hacking & patching.

This is a tool to perform proofs in various logics (e.g. propositional, predicate logic) visually

Schrödinger logics are a kind of non-classical logic in which the law of identity is restricted.

These logics are motivated by the consideration that in quantum mechanics, elementary particles may be indistinguishable, even in principle, on the basis of any measurement. This in turn suggests that such particles cannot be considered as self-identical objects in the way that such things are usually treated within formal logic and set theory.

Poor Ayn Rand 😭 all she ever wanted was a ballerina Barbie

prolog-like programming in racket programming systems.

So from day one, they warned us Turing machines are clumsy beasts where easy tasks are hard to accomplish, and generally hang unpredictably.

In terms of implementation, though, it is far from simple. Lambda calculus has variables, which introduce huge complexity into the interpreter: especially if you want to do any kind of formal reasoning about programs, this complexity is a problem. We might want to reach for something even lower-level than lambda calculus: this is where combinator calculi come in.

This is a top-down introduction to core.logic which attempts to lead you to that elusive AHA! moment of understanding what logic programming is about.

Core miniKanren extends Scheme with three operations: ==, fresh, and conde. There is also run, which serves as an interface between Scheme and miniKanren, and whose value is a list.

A useful table of all the combinators and their effects.

miniKanren is a family of Domain Specific Languages for logic programming.The name kanren comes from a Japanese word (関連) meaning “relation”.The core miniKanren language is very simple, with only three logical operators and one interface operator.The core language, using Scheme as the host language, is described in this short, interactive tutorial.

When a condition is found to be TRUE, the engine executes the THEN clause, which results in new information being added to its dataset. In other words, the engine starts with a number of facts and applies rules to derive all possible conclusions from those facts. This is where the name “forward chaining” comes from – the fact that the inference engine starts with the data and reasons its way forward to the answer, as opposed to backward chaining, which works the other way around.How about backward chaining?In backward chaining, the system works from conclusions backwards towards the facts, an approach called goal driven. Compared to forward chaining, few data are asked, but many rules are searched. Backward-chaining rules engines are not suited for dynamic situations and are mostly only used as expert systems in decision making