Received: from mail-yx0-f189.google.com ([209.85.213.189]:56273) by stodi.digitalkingdom.org with esmtps (TLSv1:RC4-SHA:128) (Exim 4.76) (envelope-from ) id 1T1K0z-0002cD-GY; Tue, 14 Aug 2012 09:30:58 -0700 Received: by yenq11 with SMTP id q11sf540570yen.16 for ; Tue, 14 Aug 2012 09:30:37 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=beta; h=x-beenthere:received-spf:mime-version:sender:in-reply-to:references :from:date:message-id:subject:to:x-original-sender :x-original-authentication-results:reply-to:precedence:mailing-list :list-id:x-google-group-id:list-post:list-help:list-archive :list-subscribe:list-unsubscribe:content-type; bh=un+kxHAk26O6KtlyeSWr2aqb/h0omPtg3MvibATQ7fo=; b=6y2uRVBSQp71rb7o1FjFn5aOBqu0BuulFvGObDXruFpw1Caq5jwxW0jEHZSEUMr5vc oA+PKjwUYrhIwlvad2X2qhhijIcu/Ep/pDe38ljyoJ//iofhTGPBkn2i5YxaatmsXZhl 3EiAZN07hUO1T6in/1HYeloWFg9JwYg+Uznog= Received: by 10.52.23.145 with SMTP id m17mr1095652vdf.0.1344961836900; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) X-BeenThere: lojban@googlegroups.com Received: by 10.52.36.147 with SMTP id q19ls462240vdj.4.gmail; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) Received: by 10.58.222.100 with SMTP id ql4mr2456472vec.22.1344961836210; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) Received: by 10.58.222.100 with SMTP id ql4mr2456471vec.22.1344961836185; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) Received: from mail-vb0-f54.google.com (mail-vb0-f54.google.com [209.85.212.54]) by gmr-mx.google.com with ESMTPS id t4si155204vds.3.2012.08.14.09.30.36 (version=TLSv1/SSLv3 cipher=OTHER); Tue, 14 Aug 2012 09:30:36 -0700 (PDT) Received-SPF: pass (google.com: domain of rpglover64@gmail.com designates 209.85.212.54 as permitted sender) client-ip=209.85.212.54; Received: by mail-vb0-f54.google.com with SMTP id v11so547235vbm.41 for ; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) Received: by 10.58.243.138 with SMTP id wy10mr2726196vec.46.1344961836033; Tue, 14 Aug 2012 09:30:36 -0700 (PDT) MIME-Version: 1.0 Sender: lojban@googlegroups.com Received: by 10.58.220.6 with HTTP; Tue, 14 Aug 2012 09:30:15 -0700 (PDT) In-Reply-To: <502A734B.1060906@gmail.com> References: <90a7e54c-42fe-4ee0-9693-8155db9a7646@googlegroups.com> <4FFDC7C8.2010707@gmail.com> <237c4ac5-64f3-40fa-81d3-8a97c76dcc5d@googlegroups.com> <1342109844.79789.YahooMailNeo@web184407.mail.bf1.yahoo.com> <4FFF180C.8060000@gmail.com> <4FFF534B.9010509@gmail.com> <5000314E.10906@gmail.com> <502A734B.1060906@gmail.com> From: ".arpis." Date: Tue, 14 Aug 2012 12:30:15 -0400 Message-ID: Subject: Re: [lojban] &Lang To: lojban@googlegroups.com X-Original-Sender: rpglover64@gmail.com X-Original-Authentication-Results: gmr-mx.google.com; spf=pass (google.com: domain of rpglover64@gmail.com designates 209.85.212.54 as permitted sender) smtp.mail=rpglover64@gmail.com; dkim=pass header.i=@gmail.com Reply-To: lojban@googlegroups.com Precedence: list Mailing-list: list lojban@googlegroups.com; contact lojban+owners@googlegroups.com List-ID: X-Google-Group-Id: 1004133512417 List-Post: , List-Help: , List-Archive: List-Subscribe: , List-Unsubscribe: , Content-Type: multipart/alternative; boundary=047d7b86ef407925d004c73c543d X-Spam-Score: -0.7 (/) X-Spam_score: -0.7 X-Spam_score_int: -6 X-Spam_bar: / --047d7b86ef407925d004c73c543d Content-Type: text/plain; charset=ISO-8859-1 > Either I've misunderstood your response, or you've misunderstood the > challenge. The challenge is that the same bound variable need never be > repeated. Sure for any given single sentence containing n different > variables you can define an equivalent single predicate with n arguments, > but you can't do this for each of the infinitely many sentences in a > language. > > But you _can_! That's how you'd build up sentences if the language's mechanism for composing concepts involves uniting them into larger predicates. That said, I have internally equated what you desire to a well-studied notion in computer science (which would need adaptation before being moved to natural language). I may have misunderstood, but I think that your notion of eliminating repeated references is equivalent to eliminating explicit references altogether. > > Other things you may want to look at: combinatory logic, >> concatenative programming (or stack-based programming), point-free >> style (or tacit programming), and the J programming language. >> > > Thanks for taking the trouble to make the suggestions, but I don't have > the requisite intellectual skills to scan outlines of those areas in the > hope of descrying a notation that doesn't require variable repetition. If > you think one of them provides a notation that doesn't require variable > repetition, it would be very precious to meif you were to explain it to me. > > Combinatory logic provides a notation based on S and K (or another one based on B, C, K, and W) for expressing predicates without explicit reference. Concatenative programming uses the idea of a stack to avoid explicit reference. The J Programming Language uses ideas from the above to be very terse and linear without explicit variables. > --and. > > > -- > You received this message because you are subscribed to the Google Groups > "lojban" group. > To post to this group, send email to lojban@googlegroups.com. > To unsubscribe from this group, send email to lojban+unsubscribe@** > googlegroups.com . > For more options, visit this group at http://groups.google.com/** > group/lojban?hl=en . > > -- mu'o mi'e .arpis. -- You received this message because you are subscribed to the Google Groups "lojban" group. To post to this group, send email to lojban@googlegroups.com. To unsubscribe from this group, send email to lojban+unsubscribe@googlegroups.com. For more options, visit this group at http://groups.google.com/group/lojban?hl=en. --047d7b86ef407925d004c73c543d Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable
Either I'= ve misunderstood your response, or you've misunderstood the challenge. = The challenge is that the same bound variable need never be repeated. Sure = for any given single sentence containing n different variables you can defi= ne an equivalent single predicate with n arguments, but you can't do th= is for each of the infinitely many sentences in a language.

But you _can_! That's how you'd build u= p sentences if the language's mechanism for composing concepts involves= uniting them into larger predicates.

That said, I have internally e= quated what you desire to a well-studied notion in computer science (which = would need adaptation before being moved to natural language). I may have m= isunderstood, but I think that your notion of eliminating repeated referenc= es is equivalent to eliminating explicit references altogether.
=A0

Other things you may want to look at: combinatory logic,
concatenative programming (or stack-based programming), point-free
style (or tacit programming), and the J programming language.

Thanks for taking the trouble to make the suggestions, but I don't have= the requisite intellectual skills to scan outlines of those areas in the h= ope of descrying a notation that doesn't require variable repetition. I= f you think one of them provides a notation that doesn't require variab= le repetition, it would be very precious to meif you were to explain it to = me.

Combinatory logic provides a notation b= ased on S and K (or another one based on B, C, K, and W) for expressing pre= dicates without explicit reference.

Concatenative programming uses t= he idea of a stack to avoid explicit reference.

The J Programming Language uses ideas from the above to be very terse a= nd linear without explicit variables.
=A0
--and.


--
You received this message because you are subscribed to the Google Groups &= quot;lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@goo= glegroups.com.
For more options, visit this group at http://groups.google.com/grou= p/lojban?hl=3Den.




--
mu'o mi= 'e .arpis.

--
You received this message because you are subscribed to the Google Groups "= lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@googlegrou= ps.com.
For more options, visit this group at http://groups.google.com/group/lojban= ?hl=3Den.
--047d7b86ef407925d004c73c543d--