swipl-devel
scryer-prolog
swipl-devel | scryer-prolog | |
---|---|---|
19 | 42 | |
902 | 1,895 | |
1.4% | - | |
9.9 | 9.7 | |
2 days ago | 8 days ago | |
C | Rust | |
GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
swipl-devel
-
If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
Still, there are many useful tools based on these ideas, used by programmers and mathematicians alike. What you describe sounds rather like Datalog (e.g. Soufflé Datalog), where you supply some rules and an initial fact, and the system repeatedly expands out the set of facts until nothing new can be derived. (This has to be finite, if you want to get anywhere.) In Prolog (e.g. SWI Prolog) you also supply a set of rules and facts, but instead of a fact as your starting point, you give a query containing some unknown variables, and the system tries to find an assignment of the variables that proves the query. And finally there is a rich array of theorem provers and proof assistants such as Agda, Coq, Lean, and Twelf, which can all be used to help check your reasoning or explore new ideas.
-
Scryer Prolog
SWIProlog[1] has so far been my go to due to the extensive support system it has. However, I've been meaning to explore higher order logic a bit and Ciao[2] caught my attention there, with sugar for function-like notation and higher order programming including "lambda" style predicate expressions .... and it compiles down to executable. The function notation in this context is along the same lines as Mozart/Oz and can be convenient. Not explore the higher order aspects much though.
[1]: https://www.swi-prolog.org/
[2]: https://en.wikipedia.org/wiki/Ciao_(programming_language)
-
Not all possible results of a simple predicate given by backtracking.
?- version(). Welcome to SWI-Prolog (threaded, 64 bits, version 9.0.0)SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details.For online help and background, visit https://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). true. ?- del(a, L, [1,2,3]). L = [a, 1, 2, 3] ; L = [1, a, 2, 3] ; L = [1, 2, a, 3] ; L = [1, 2, 3, a] ; false.
- Looking for suggestions of interesting language to learn
-
Could this code calculating primes be much more optimized?
$ swipl Welcome to SWI-Prolog (threaded, 64 bits, version 8.5.10) SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit https://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- [fm2gp_primes]. true. ?- time( setup_call_cleanup(open('prolog-primes.txt', write, Out), with_output_to(Out, primes(500_000)), close(Out)) ). % 8,766,852 inferences, 1.055 CPU in 1.198 seconds (88% CPU, 8311018 Lips) Out = (0x600000648100).
-
Anyone got lots of trivial DCG examples?
The utilities in dgc/bacics.pl that you linked yourself are not too advanced, too quickly. Understanding those is exactly what you need in order to be able to write useful grammars for two reasons. They show how to approach many common issues with DCGs; and you know what building blocks you have at your disposal. I feel you discarded those too fast and strongly suggest you try to revisit them.
-
Is Datalog a good language for authorization?
- And last but not least... the ability to convert authorization logic into SQL [4]. Which is done by having the language return constraints over any unbound (free) variables.
To me this is what makes logic programming exciting for authorization. It gives you this small kernel of declarative programming, and gives you a ton of freedom to build on top.
[1] https://www.swi-prolog.org/
-
What is your favorite programming language that isn't Haskell?
(Btw. I'm using SWI Prolog.)
-
What happened to clumped/2 in SWI-Prolog?
Welcome to SWI-Prolog (threaded, 64 bits, version 8.0.2) SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit http://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- use_module(library(lists)). true. ?- clumped([a,a,a,b,b,c], Rs). ERROR: Undefined procedure: clumped/2 (DWIM could not correct goal) ?-
-
Choicepoints and empty lists
Many library predicates do the argument reordering to take advantage of this special case argument indexing as explained in the answer by u/mycl. For example library(apply) in SWI-Prolog. is full of those.
scryer-prolog
-
The Shen Programming Language
thank you! the scryer community deserves much of the credit too. everyone is welcome and encouraged to join us at https://github.com/mthom/scryer-prolog! some exciting plans in the pipe
- Appreciating Clpz_t/2
- Advent of Code 2023 is nigh
- Scryer Prolog version 0.9.3 is out
- Announcing Basic WebAssembly support in Scryer Prolog
- Basic WebAssembly Support in Scryer Prolog
- Scryer-Prolog 0.9.2
- Release v1.1.0 of PostgreSQL-Prolog
-
Djot is a light markup syntax
Djot is the markup syntax that is used for the documentation of Scryer Prolog, using a parser written in Prolog:
https://github.com/aarroyoc/djota
It works well so far. One of the few limitations I noticed so far pertains to the formatting of tables. For instance, consider the table used in library(format) to describe control sequences:
https://github.com/mthom/scryer-prolog/blob/b0566e41503a6c8d...
It contains several entries that span multiple lines, yet are meant to denote only a single row of the table, such as:
% | `~Nr` | where N is an integer between 2 and 36: format the |
- The First Annual Scryer Prolog Meetup
What are some alternatives?
tau-prolog - An open source Prolog interpreter in JavaScript
logica - Logica is a logic programming language that compiles to SQL. It runs on Google BigQuery, PostgreSQL and SQLite.
the-power-of-prolog - Introduction to modern Prolog
differential-datalog - DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output in response to input changes. A DDlog programmer does not write incremental algorithms; instead they specify the desired input-output mapping in a declarative manner.
Vim - The official Vim repository
materialize - The data warehouse for operational workloads.
biscuit-rust - Rust implementation of the Biscuit authorization token
MongoDB - The MongoDB Database
prolog - The only reasonable scripting engine for Go.
Apache - Mirror of Apache HTTP Server. Issues: http://issues.apache.org
otp - Erlang/OTP