Thanks to everyone who responded (privately and otherwise) for the nice
words.
Sage Gerard: To each its own. I’m glad to hear that you have these success
cases with Racket
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from
Hi all,
Here are the videos:
Playing the Game with PLT Redex: https://youtu.be/NszLQNROdw0
Understanding the Type of call/cc: https://youtu.be/7Zkt_IJaYOY
Racket: Why I Think It’s a Great Language, and Why I’m Not Using It
Anymore: https://youtu.be/_wY7FBtr7_c
The first two used to be articles
> It's decrementing, isn't it? It just says since how long it's open I guess :)
Yes, I mistyped—it’s decrementing.
I think you should be saying “Registration is open «Link for registration»”.
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because
Got it. Thanks.
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@google
Please help me understand the following:
#lang racket
(define s (eval '(begin (require racket/set) (set 1 2)) (make-base-namespace)))
s ;; ⇒ (set 1 2)
(set? s) ;; ⇒ #f (but I expected ‘#t’)
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed
would add the elements to the sets in the same order
every time, so lists with unique elements would be equivalent to sets. It turns
out that I was wrong. Case closed.
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the Google Groups
to keep investigating…
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@google
I rewrote a codebase that was using ‘set’s to use lists that I
‘remove-duplicates’ whenever I ‘cons’. The result is orders of magnitude
faster. Do you have any idea why?
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the Google
le resulta em erro.
Talvez o que você precise seja uma estrutura de dados (uma lista, um
dicionário, ou algo do gênero), que contenha todos os questao_solve indexados
por número.
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the Goo
re detail. I consider this
to be a better bridge between knowing little about programming-language theory
and being able to follow more advanced material, for example, the excellent
SEwPR.
I welcome feedback.
Thank you for your time.
--
Leandro Facchinetti
https://www.leafac.com
--
nts both “Timed out” after 5 seconds and “Finished”
after 10 seconds. I wish ‘with-limits’ would stop the underlying process, so
I’d never see “Finished”. How should I do that?
Thank you.
--
Leandro Facchinetti
https://www.leafac.com
--
You received this message because you are subscribed to the
As far as I understand, your ‘length-ok’ is implementing in Redex the ‘(<=
(length ___) ___)’ I had in my ‘side-condition’. But I can’t see how it
addresses two important features from my original code: (1) ‘k’ is
parameterizable, and its value influences whether a list is valid or not;
and
> But I clearly don’t get what you really want so I will abandon this one.
>
> Good luck — Matthias
>
Thanks for trying, talking to you is always instructive
For people that hasn’t abandoned this one: I decided to bite the bullet and
thread the ‘metaparameter’ in my definitions. This will
> Robby’s message dominates mine but I don’t get why you can’t work your way
> thru what I provided.
>
I don’t see the connection between the issue I brought up and what you
provided. In your program ‘r-r/tick’ is a form to define a reduction
relation which manages ‘clock’, but then ‘clock’
> Stepping back a little bit here, if you were to write this down in a
> way that were to make sense to a reader of a paper, how would you
> communicate with them how/when this parameter changes?
>
When defining metafunctions/reduction relations/judgment forms and so on,
authors generally
This is going further in the wrong direction
1. The cache for the reduction relation is invalid.
2. There’s no way to parameterize ‘clock’ when calling the reduction
relation (I think it’d really help to think of ‘k’ instead of ‘clock’).
3. ‘clock’ isn’t available to metafunctions called
I see how this makes typesetting work. But I’m sorry but I don’t see how
this program addresses any of my concerns: ‘clock’ is still unavailable to
when defining ‘go’; and worse, there’s no way to set it from the outside.
--
You received this message because you are subscribed to the Google
Thanks for the clarification, I think I understand your proposal. And I see
three problems:
1. I believe ‘traces/t’ is the evidence of the issue I brought up
earlier: How do call sites know the form expects the extra argument? As
your example demonstrates, call sites need to be explicit about
A related question is
> to ask if maybe the parameter is intended to be so "dyanmic". Maybe
> you should have to recompile the redex program to change the parameter
> sometimes because, after all, if runs of the abstract machine with
> different values of `k` interact with each other, maybe
> What if you wrote macros over reduction-relation instead of the exact
> model? These macros could implement threading and hide it. They would kind
> of be like monads here. — Matthias
>
Do you mean something like
(define-parameterized-metafunction (k) L
tick : e _ _ _ t -> t
> Yes, it looks like the original cache is just re-installed when re-enabled.
>
> Perhaps there should be an operation provided by Redex to clear away the
> cache.
>
That’s one my proposals, yes (see § Solutions on my original message)
--
You received this message because you are
e suggestion. But I
still think macro-defined models are not the right abstraction here.
--
Leandro Facchinetti <m...@leafac.com>
https://www.leafac.com
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from t
Hi Matthias,
I am replaying publicly to thank you for the kind words, they surely
motivate me to keep going! :)
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG: 0x5925D0683DF3D583
--
You received this message because you are subscribed to the Google Groups
"R
f
:)
I’d love to continue having your feedback on this series. When I have
the next articles ready, can I keep sending them your way? I expect I’ll
have one per month.
Best.
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG: 0x5925D0683DF3D583
--
You received this mess
:
>
> "satisfy curiosity", not 'satisfying a'
>
> "they use fewer features", not 'less features'. Fewer is for countable
> nouns, less is for mass nouns. "Fewer features", "less salt".
I fixed the errors you pointed out. Thank you very much. E
/pollen-component/index.html
- Extensible Functions: A solution to the expression problem in Typed Racket.
https://docs.racket-lang.org/extensible-functions/index.html
Thank you.
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG: 0x5925D0683DF3D583
--
You re
Hi WarGrey Gyoudmon Ju,
I’m happy to know that other people are working on the same space. It
seems like we’re taking different approaches and I’d like to see your
project when you release it.
Best.
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG: 0x5925D0683D
Hi, all.
Thanks for the feedback and for the acknowledgment on the Errata
page. And thanks for answering my question about typesetting. I can
confirm that I get small-caps using the provided snippet.
Best.
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG key: 3D
nd advice.
Best.
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG key: 3DF3D583
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
ic scoping?
I ask that because I'm currently working on a language which notion of
scoping is something in between lexical and dynamic.
> Bugs in substitution functions are the worst.
Indeed :)
--
Leandro Facchinetti <lfacc...@jhu.edu>
https://www.leafac.com
GPG key: 3DF3D583
--
30 matches
Mail list logo