swipl-devel
racket
swipl-devel | racket | |
---|---|---|
19 | 188 | |
902 | 4,695 | |
1.4% | 0.4% | |
9.9 | 9.7 | |
2 days ago | 1 day ago | |
C | Racket | |
GNU General Public License v3.0 or later | 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.
racket
- Racket Language
-
Racket–the Language-Oriented Programming Language–version 8.12 is now available
Racket—the Language-Oriented Programming Language—version 8.12 is now available from https://racket-lang.org
See https://racket.discourse.group/t/racket-v8-12-is-now-availab... for the release announcement and highlights.
Thank you to the many people who contributed to this release!
Feedback Welcome
-
Racket version 8.11.1 is now available
Racket version 8.11.1 is now available from https://racket-lang.org/
-
Ask HN: Does anyone Lisp without Emacs?
Racket (https://racket-lang.org) has an IDE (DrRacket) which isn't EMACS. ARC (which powers hacker news) is (was?) written in Racket.
-
Douglas Crockford, author of ‘Javascript: the good parts’ and ‘How Javascript works’ will be giving the keynote presentation From Here To Lambda And Back Again at the thirteenth RacketCon.
Nice! Repeating a comment I just made on HN: I signed up for RacketCon, will be joining remotely. I am looking forward to it a lot. Usually I use the Racket language perhaps for 10% of my personal projects, but I am currently writing a Racket AI book, so all things Racket are of current interest. Past RacketCons have been a lot of fun. I usually use Common Lisp, but Racket is batteries included Scheme, and more, and is a very pleasant language and ecosystem. Just in case you don’t have Racket installed: https://racket-lang.org/
-
Douglas Crockford to Keynote 'From Here to Lambda and Back Again' at Racke
I signed up for RacketCon, joining remotely. I am looking forward to it a lot. Usually I use the Racket language perhaps for 10% of my personal projects, but I am currently writing a Racket AI book, so all things Racket are of current interest.
Past RacketCons have been a lot of fun.
I usually use Common Lisp, but Racket is batteries included Scheme, and more, and is a very pleasant language and ecosystem. Just in case you don’t have Racket installed: https://racket-lang.org/
-
Ask HN: What is the most suitable Scheme implementation to learn today?
I'd suggest Racket (https://racket-lang.org) which is a batteries-included language environment that includes scheme and has a lot of high-quality documentation.
Guile (https://www.gnu.org/software/guile/) isn't quite as learner-focused but is another great choice.
-
What Programming Languages are Best for Kids?
How did I get to the bottom of the page and not ONE person has recommended racket?
-
Setting up a Scheme coding environment in VS code?
The Racket fork of CS supports Apple Silicon natively, and can be installed independently: https://github.com/racket/racket/blob/master/racket/src/ChezScheme/BUILDING Chez adds a few features (threads, ffi, ...) to R6RS; there is a useful combined index to TSPL4 and the CS User Guide at http://cisco.github.io/ChezScheme/csug9.5/csug_1.html
-
Is SICP an overkill for a 14 year old?
If you're using SICP in Scheme (or are you doing the JS version?) then you may want to look at How to Design Programs. It uses Racket which is a Scheme descendent so much of the language you've learned in SICP will work in it without issue. It also has a pretty good set of GUI and drawing capabilities you can find through the Racket docs page and will use some of with HTDP.
What are some alternatives?
scryer-prolog - A modern Prolog implementation written mostly in Rust.
Visual Studio Code - Visual Studio Code
tau-prolog - An open source Prolog interpreter in JavaScript
clojure - The Clojure programming language
the-power-of-prolog - Introduction to modern Prolog
nannou - A Creative Coding Framework for Rust.
Vim - The official Vim repository
antlr-tsql
biscuit-rust - Rust implementation of the Biscuit authorization token
babashka - Native, fast starting Clojure interpreter for scripting
MongoDB - The MongoDB Database
coalton - Coalton is an efficient, statically typed functional programming language that supercharges Common Lisp.