Ukanren
Soufflé | Soufflé • A Datalog Synthesis Tool for Static Analysis
Datalog#programming#language#Datalog#logic#declarative#C++#open source#License: UPL-1.0#static#analysisFlix | The Flix Programming Language
Scallop
ichiban/prolog
The only reasonable scripting engine for Go
Реалізації
Освітні матеріали
Adventure in Prolog | SpringerLink
Building Expert Systems in Prolog | SpringerLink
klaudiosinani/awesome-prolog: Curated list of Prolog packages and resources
Curated list of Prolog packages and resources.
miniKanren.org
Indexing dif/2
Many Prolog programs are unnecessarily impure because of inadequate means to express syntactic inequality. While the frequently provided built-in dif/2 is able to correctly describe expected answers,
its direct use in programs often leads to overly complex and inefficient definitions — mainly due to the
lack of adequate indexing mechanisms. We propose to overcome these problems by using a new predicate
that subsumes both equality and inequality via reification. Code complexity is reduced with a monotonic,
higher-order if-then-else construct based on call/N. For comparable correct uses of impure definitions, our
approach is as determinate and similarly efficient as its impure counterparts.
An Elementary Prolog Library
Rethinking Prolog
The strong points of Prolog can be brought into an ordinary functional programming language. Using OCaml as a representative, we implement lazy guessing as a library, with which we reproduce classical Prolog examples.
Correctness Considerations in CLP(FD) Systems
In this thesis, we show examples of common limitations and mistakes of several widely used CLP(FD) systems. We then present a new CLP(FD) system that overcomes some of these issues.
Coding guidelines for Prolog
SWI-Prolog
In this article we present SWI-Prolog as an integrating tool, supporting a wide range of ideas developed in the Prolog community and acting as glue between <i>foreign</i> resources. This article itself is the glue between technical articles on SWI-Prolog, providing context and experience in applying them over a longer period.
Portability of Prolog programs: theory and case-studies
(Non-)portability of Prolog programs is widely considered as an important factor in the lack of acceptance of the language. Since 1995, the core of the language is covered by the ISO standard 13211-1. Since 2007, YAP and SWI-Prolog have established a basic compatibility framework. This article describes and evaluates this framework. The aim of the framework is running the same code on both systems rather than migrating an application. We show that today, the portability within the family of Edinburgh/Quintus derived Prolog implementations is good enough to allow for maintaining portable real-world applications.
Lambdas in ISO Prolog
Higher order programming is possible in Prolog. There is no need to extend the language for that. See Richard O'Keefe's arguments in comp.lang.prolog more than ten years ago. What is missing are lambda expressions.
We present a very simple implementation of lambda expressions in ISO Prolog that fits into the existing conventions for higher order predicates based on call/N. No syntax or compiler extension is needed.
Precise Garbage Collection in Prolog
In this paper we present a series of tiny programs that verify that a Prolog heap garbage collector can find specific forms of garbage.
DCGs + Memoing = Packrat Parsing. But is it worth it?
Packrat parsing is a newly popular technique for efficiently implementing recursive descent parsers. Packrat parsing avoids the potential exponential costs of recursive descent parsing with backtracking by ensuring that each production rule in the grammar is tested at most once against each position in the input stream. This paper argues that (a) packrat parsers can be trivially implemented using a combination of definite clause grammar rules and memoing, and that (b) packrat parsing may actually be significantly less efficient than plain recursive descent with backtracking, but (c) memoing the recognizers of just one or two nonterminals, selected in accordance with Amdahl’s law, can sometimes yield speedups. We present experimental evidence to support these claims.
Наукові публікації#2008#parsing#grammar#recursive descent#Mercury#parser#logic#programming#публікаціяOdd Prolog Benchmarking
Logic programming for the real world
Use of Prolog for developing a new programming language
This paper describes how Prolog was used for the development of a new concurrent realtime symbolic programming language called Erlang.
The birth of Prolog
The programming language, Prolog, was born of a project aimed not at producing a programming language but at processing natural languages; in this case, French. The project gave rise to a preliminary version of Prolog at the end of 1971 and a more definitive version at the end of 1972. This article gives the history of this project and describes in detail the preliminary and then the final versions of Prolog. The authors also felt it appropriate to describe the Q-systems since it was a language which played a prominent part in Prolog’s genesis.
The family of concurrent logic programming languages
The early years of logic programming
This firsthand recollection of those early days of logic programming traces the shared influences and inspirations that connected Edinburgh, Scotland, and Marseilles, France.
Algorithm = Logic + Control
Can Logic Programming Be Liberated from Predicates and Backtracking?