Lisp Scheme Part41 (808ﾚｽ)

Lisp Scheme Part41 http://mevius.5ch.net/test/read.cgi/tech/1531587928/

上下前次1-新
通常表示 512ﾊﾞｲﾄ分割 ﾚｽ栞
抽出解除 必死ﾁｪｯｶｰ(本家) (べ) 自ID ﾚｽ栞 あぼーん

---

803: デフォルトの名無しさん [] 2025/07/22(火) 23:09:36.04 ID:7KXgok3Q 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, ***************** http://mevius.5ch.net/test/read.cgi/tech/1531587928/803

---

ﾒﾓ帳

(0/65535文字)

---

上下前次1-新書関写板覧索設栞歴

---

ｽﾚ情報 赤ﾚｽ抽出 画像ﾚｽ抽出 歴の未読ｽﾚ AAｻﾑﾈｲﾙ

---

Google検索

Wikipedia

---

ぬこの手 ぬこTOP 1.122s*