Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.lisp > #28610

Re: The simplest compiler possible

From Kaz Kylheku <221-501-9011@kylheku.com>
Newsgroups comp.lang.lisp, comp.lang.forth
Subject Re: The simplest compiler possible
Followup-To comp.lang.lisp
Date 2017-01-31 14:32 +0000
Organization Aioe.org NNTP Server
Message-ID <20170131062108.962@kylheku.com> (permalink)
References (1 earlier) <87sho1z44e.fsf@nightsong.com> <barmar-60105B.12125730012017@88-209-239-213.giganet.hu> <o6nucj$nim$1@cherry.spenarnc.xs4all.nl> <o6pdaj$465$1@dont-email.me> <87zii7y9y8.fsf@nightsong.com>

Cross-posted to 2 groups.

Followups directed to: comp.lang.lisp

Show all headers | View raw

On 2017-01-31, Paul Rubin <no.email@nospam.invalid> wrote:
> rpw3@rpw3.org (Rob Warnock) writes:
>> | E.g. lambda ask for a textual replacement system that is non-trivial.
>> I don't know where you heard that idea, but it's incorrect.
>> In the programming language Lisp, the lambda operator does *NOT*
>> require a "textual replacement" of any kind
>
> Church's lambda calculus called for textual substitution aka beta
> reduction.  Lisp implements it in a different way.

Lambda calculus is an extension to mathematics which anonymizes
functions, allowing them to to be literal terms like numbers or sets,
and appear as values of variables, including function arguments.
That's the "big deal" in lambda calculus.

Lambda calculus isn't Lisp. It doesn't have code made up of conses
and atoms. It doesn't have EVAL or QUOTE. It doesn't have symbols
as a data type. (Term substitutions in lambda calculus manipulation are
sort of quoting, but they are outside of lambda calculus. Just like
simplifying a polynomial is outside of algebra.)

Also, Lisp was originally dynamically scoped, whereas lambda calculus
has lexical scope.

Lambda calculus can also come in a typed variety, whereas Lisp
is dynamic.

Even though "lambda calculus" has "lambda" in it, and lisp has lambda,
there is a stronger connection between lambda calculus and the pure
fucntional languages than between lambda calculus and Lisp.

Back to comp.lang.lisp | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-01-29 19:54 +0100
  Re: The simplest compiler possible Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-29 19:18 +0000
    Re: The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-01-30 02:22 +0100
      Re: The simplest compiler possible Paul Rubin <no.email@nospam.invalid> - 2017-01-29 18:13 -0800
        Re: The simplest compiler possible Barry Margolin <barmar@alum.mit.edu> - 2017-01-30 12:12 -0500
          Re: The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-01-30 18:50 +0100
            Re: The simplest compiler possible rpw3@rpw3.org (Rob Warnock) - 2017-01-31 07:11 +0000
              Re: The simplest compiler possible Paul Rubin <no.email@nospam.invalid> - 2017-01-30 23:17 -0800
                Re: The simplest compiler possible Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-31 14:32 +0000
                Re: The simplest compiler possible Barry Margolin <barmar@alum.mit.edu> - 2017-01-31 15:12 -0500
              Re: The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-01-31 11:39 +0100
                Re: The simplest compiler possible Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-31 14:19 +0000
          Re: The simplest compiler possible Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-30 19:10 +0000
            Re: The simplest compiler possible Barry Margolin <barmar@alum.mit.edu> - 2017-01-30 16:19 -0500
              Re: The simplest compiler possible Paul Rubin <no.email@nospam.invalid> - 2017-01-30 15:00 -0800
                Re: The simplest compiler possible Christian Jullien <christian.jullien@novasparks.com> - 2017-01-30 23:19 -0800
                Re: The simplest compiler possible Barry Margolin <barmar@alum.mit.edu> - 2017-01-31 15:03 -0500
  Re: The simplest compiler possible anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2017-01-31 13:17 +0000
    Re: The simplest compiler possible Barry Margolin <barmar@alum.mit.edu> - 2017-01-31 15:10 -0500
      Re: The simplest compiler possible Elias Mårtenson <lokedhs@gmail.com> - 2017-01-31 20:08 -0800
        Re: The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-02-01 12:12 +0100
  Re: The simplest compiler possible a.daniel.eliason@gmail.com - 2017-02-22 12:44 -0800
    Re: The simplest compiler possible albert@cherry.spenarnc.xs4all.nl (Albert van der Horst) - 2017-02-23 12:14 +0100

csiph-web