swipl-devel
SWI-Prolog Main development repository (by SWI-Prolog)
futhark
:boom::computer::boom: A data-parallel functional programming language (by diku-dk)
| swipl-devel | futhark | |
|---|---|---|
| 19 | 52 | |
| 902 | 2,293 | |
| 1.4% | 1.8% | |
| 9.9 | 9.8 | |
| 2 days ago | 6 days ago | |
| C | Haskell | |
| GNU General Public License v3.0 or later | ISC License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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
Posts with mentions or reviews of swipl-devel.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-07-11.
-
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.
futhark
Posts with mentions or reviews of futhark.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-06-19.
-
What downsides exist to Futhark? Seems almost too good to be true?
Why Futhark? (futhark-lang.org)
-
GPU Programming: When, Why and How?
There is no on-going work to support Metal apart from the work done by Miles. There's an old issue about it: https://github.com/diku-dk/futhark/issues/853#issuecomment-5...
-
Is Parallel Programming Hard, and, If So, What Can You Do About It? v2023.06.11a
Functional programming can be a great way to handle parallel programming in a sane way. See the Futhark language [1], for example, that accepts high-level constructs like map and convert them to the appropriate machine code, either on the CPU or the GPU.
[1] https://futhark-lang.org/
-
Is there a programming language that will blow my mind?
Futhark - use a functional language to program the gpu
-
Does This Language Exist?
You might want to look into Futhark, although it's mainly designed for writing GPU code.
- Learn WebGPU
-
Two-tier programming language
Futhark https://futhark-lang.org/
- Best book on writing an optimizing compiler (inlining, types, abstract interpretation)?
- Functional GPU programming: what are alternatives or generalizations of the idea of "number of cycles must be known at compile time"?
- APL: An Array Oriented Programming Language (2018)
What are some alternatives?
When comparing swipl-devel and futhark you can also consider the following projects:
scryer-prolog - A modern Prolog implementation written mostly in Rust.
arrayfire-rust - Rust wrapper for ArrayFire
tau-prolog - An open source Prolog interpreter in JavaScript
dex-lang - Research language for array processing in the Haskell/ML family
the-power-of-prolog - Introduction to modern Prolog
Halide - a language for fast, portable data-parallel computation
Vim - The official Vim repository
julia - The Julia Programming Language
biscuit-rust - Rust implementation of the Biscuit authorization token
BQN - An APL-like programming language. Self-hosted!
MongoDB - The MongoDB Database
kompute - General purpose GPU compute framework built on Vulkan to support 1000s of cross vendor graphics cards (AMD, Qualcomm, NVIDIA & friends). Blazing fast, mobile-enabled, asynchronous and optimized for advanced GPU data processing usecases. Backed by the Linux Foundation.