Lisp Scheme Part41 (809レス)
上下前次1-新
抽出解除 必死チェッカー(本家) (べ) 自ID レス栞 あぼーん
リロード規制です。10分ほどで解除するので、他のブラウザへ避難してください。
803: 07/22(火)23:09 ID:7KXgok3Q(1) AAS
To: **************
Subject: First Lambda = A tail-call-like optimization that lets you write syntax as functions
Dear *********,
The project is still in the early stage of theoretical modeling and representation-level experimentation.
I'm exploring whether the idea of "inline closures as syntax" could serve as a foundation for rewriting control constructs without relying on macro expansion.
First Lambda has the form:
((lambda ...
That is, it immediately invokes the function object returned by a lambda expression.
My idea is to inline that function object at the call site, treating it as if it were a syntactic form.
I believe many constructs like let and while naturally take this shape.
I would greatly appreciate your thoughts on this idea.
Best regards,
*****************
上下前次1-新書関写板覧索設栞歴
スレ情報 赤レス抽出 画像レス抽出 歴の未読スレ AAサムネイル
ぬこの手 ぬこTOP 0.046s