swipl-devel
adventofcode
swipl-devel | adventofcode | |
---|---|---|
19 | 718 | |
902 | 65 | |
1.4% | - | |
9.9 | 9.0 | |
2 days ago | 4 months ago | |
C | Scala | |
GNU General Public License v3.0 or later | - |
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.
adventofcode
-
-❄️- 2023 Day 6 Solutions -❄️-
On GitHub.
-
-🎄- 2022 Day 21 Solutions -🎄-
My Scala solution – to be cleaned up.
-
Advent of Code (in MiniScript), Day 18
Welcome back to my series of Advent of Code solutions in MiniScript! Day 18 was pretty straightforward, though it presents some interesting choices in how to represent the data -- choices I'm not sure I made optimally.
-
-🎄- 2022 Day 18 Solutions -🎄-
My Scala solution.
-
Late bloomers (that started life closer to 30), how are things going for you?
And I've solved all of the Advent of Code problems so far this year, which is utterly unimportant but still brings me joy.
-
Coding/programming is absolutely fantastic
If you'd enjoy some coding challenges, advent of code (https://adventofcode.com/) is currently going on.
-
Advent of Code (in MiniScript), Day 17
Welcome back to my series of Advent of Code solutions in MiniScript! In Day 17 we got to (sort of) play Tetris. Five different Tetris-like shapes fall into a pit, moved left or right on each step according to the input. The first task is to see how high this stack will grow after 2022 blocks have been dropped in.
- Can someone give me a good idea for C# console app I could make?
- The Empty List
-
Advent of Code (in MiniScript), Day 16
Welcome back to my series of Advent of Code solutions in MiniScript! Day 16 was... how to put this?
What are some alternatives?
scryer-prolog - A modern Prolog implementation written mostly in Rust.
codewars.com - Issue tracker for Codewars
tau-prolog - An open source Prolog interpreter in JavaScript
bitburner - Bitburner Game
the-power-of-prolog - Introduction to modern Prolog
LeetCode - This is my LeetCode solutions for all 2000+ problems, mainly written in C++ or Python.
Vim - The official Vim repository
Exercism - Scala Exercises - Crowd-sourced code mentorship. Practice having thoughtful conversations about code.
biscuit-rust - Rust implementation of the Biscuit authorization token
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
MongoDB - The MongoDB Database
Advent-of-Code - Advent of Code