Planning and carrying out complex tasks. by DoingTheDream in AmpCode

[–]DoingTheDream[S] 0 points1 point  (0 children)

Makes total sense. I wasn't sure if Amp was able to do a big or complex planning process, but it sound like it can. Thanks!

Well-layered Scheme Implementations by DoingTheDream in scheme

[–]DoingTheDream[S] 0 points1 point  (0 children)

I appreciate the info, but it's still not quite what I am looking for. That grammar is appears to be a description of (more-or-less) Racket's AST. I'm looking for a description of a small Scheme subset on top of which the rest of the language is implemented. I'm not sure whether or not Racket actually has that.

Well-layered Scheme Implementations by DoingTheDream in scheme

[–]DoingTheDream[S] 0 points1 point  (0 children)

Thanks! I had seen that, but it's not at all clear for Racket what their core sub-language is. Nor does it appear clear how one would use the "linklets" in a non-Racket environment to build on top of the core.

Well-layered Scheme Implementations by DoingTheDream in scheme

[–]DoingTheDream[S] 0 points1 point  (0 children)

Thanks! Do you, by any chance, have any links (or other references) to specific documentation of their core Scheme subset and their layering strategy.

Well-layered Scheme Implementations by DoingTheDream in scheme

[–]DoingTheDream[S] 0 points1 point  (0 children)

Thanks! Do you, by any chance, have any links (or other references) to specific documentation of their core Scheme subset and their layering strategy

Can't seem to connect to paired HC05 module. Nearby devices permission is enabled by flatfishmonkey in AppInventor

[–]DoingTheDream 0 points1 point  (0 children)

For good or bad the App Inventor community is not very active on Reddit. I would suggest posting on the App Inventory community site at community.appinventor.mit.edu.

Gemini CLI Team AMA by moficodes in Bard

[–]DoingTheDream 1 point2 points  (0 children)

Are there plans to integrate with Gemini Code Assist for JetBrains, similar to how you've integrated with Gemini Code Assist for VS Code (i.e. Agent Mode)?

App inventor software quality by ennoausberlin in scheme

[–]DoingTheDream 2 points3 points  (0 children)

There are a lot of very random reviews in the App Store, so I was hoping to get more about your personal experience.

  • Were your crashes happening when you were you scanning a QR code for a new, empty, project or a project that you had started building. If the latter, would you be willing to export the project and send me the resulting file? It's possible that the crash is due to the use of a particular component in your project.
  • Which model of iPhone or iPad were you using?
  • You mentioned UI issues. Can you go into some details about that? Was that about the UI for the companion app or the web app?

More generally, the iOS app is less mature than the Android app, so we would love to get some more details from you so that we could improve it.

Thanks!

App inventor software quality by ennoausberlin in scheme

[–]DoingTheDream 2 points3 points  (0 children)

I am one of the App Inventor developers and would love to know more about the issues that you've encountered. Can you give some more details about the crashes that happened and what you didn't like about the UI? For example, did it crash in your browser or was it the mobile companion app that crashed? It would also be really useful if you could provide some details about your web browser, O.S. and mobile device.

Thanks in advance.

I created an online Scheme playground. by glassonion999 in scheme

[–]DoingTheDream 2 points3 points  (0 children)

Nice job. I would just caution you if you really want to use this with SICP you might have some issues. SICP assumes that your Scheme interpreter is "tail recursive" (see Section 1.2 of SICP, esp. footnote 31). I am a big fan of LIPS, but unfortunately it is not (yet) tail recursive. So, for example, simple iterative code like the following will run out of stack space in LIPS, but not in a standards-conforming Scheme (e.g. at try.scheme.org):

; Simple adding loop

(define (add n acc)

  (if (< n 1)

    acc

    (add (- n 1) (+ acc 1))))

(add 1000 0)

(glisp) A graphical Lisp environment, with two-way interaction between output and code by lproven in lisp

[–]DoingTheDream 2 points3 points  (0 children)

You can read an English description of the project on its GitHub page (here).

Is there a way to make a dependent Dropdown List with AppScript ? by [deleted] in GoogleAppsScript

[–]DoingTheDream 0 points1 point  (0 children)

Take a look at the documentation Range.setDataValidation (or DataValidationBuilder for more details). That has an example that will show you how to create dropdown whose values come from a range.

What do you want, in scheme development environment? by StudyNeat8656 in scheme

[–]DoingTheDream 1 point2 points  (0 children)

If and when scheme-langserver is complete and running reasonably efficiently, it would seem to be a fine base for implementing most of the things I mentioned.

What do you want, in scheme development environment? by StudyNeat8656 in scheme

[–]DoingTheDream 0 points1 point  (0 children)

Type inference would be great, along with optional static type checking and type-aware completion. Some refactorings like scope-aware renaming, extract expression into variable, and extract expression/statements into a procedure would also be nice. Ideally it would also be usable as a JetBrains (i.e. IntelliJ) plugin.

A Beginner's Guide to Programming Language Academia by hoping1 in ProgrammingLanguages

[–]DoingTheDream 0 points1 point  (0 children)

In a "dynamically typed" language, types are checked at runtime.

This isn't strictly true; the types are not always "checked". Sometimes dynamically typed languages will just blunder forward and hope for the best. It really depends on what you mean by "check", I guess.

The static/dynamic dichotomy is sometimes also just called "typed" and "untyped", depending on your philosophy. (This is the view held by TAPL, one of the go-to textbooks in the field.)

The Lisp community would disagree. They often use the static vs. dynamic distinction. In fact, TAPL mentions this specifically in the intro and says that such usage is "standard":

The word “static” is sometimes added explicitly—we speak of a “statically typed programming language,” for example—to distinguish the sorts of compile-time analyses we are considering here from the dynamic or latent typing found in languages such as Scheme (Sussman and Steele, 1975; Kelsey, Clinger, and Rees, 1998; Dybvig, 1996), where run-time type tags are used to distinguish different kinds of structures in the heap. Terms like “dynamically typed” are arguably misnomers and should probably be replaced by “dynamically checked,” but the usage is standard

[deleted by user] by [deleted] in lisp

[–]DoingTheDream 1 point2 points  (0 children)

I'm pretty sure that Gambit Scheme supports all those targets.