Deutsch English Français Italiano |
<20241001075724.000071a2@gmail.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: John Ames <commodorejohn@gmail.com> Newsgroups: alt.folklore.computers,comp.os.linux.misc Subject: Re: TeX and Pascal [was Re: The joy of FORTRAN] Date: Tue, 1 Oct 2024 07:57:24 -0700 Organization: A noiseless patient Spider Lines: 12 Message-ID: <20241001075724.000071a2@gmail.com> References: <pan$96411$d204da43$cc34bb91$1fe98651@linux.rocks> <5mqdnZuGq4lgwm_7nZ2dnZfqnPSdnZ2d@earthlink.com> <vcub5c$36h63$1@dont-email.me> <1r0e6u9.1tubjrt1kapeluN%snipeco.2@gmail.com> <vcuib9$37rge$5@dont-email.me> <vcvuhh$3hroa$2@dont-email.me> <llhieuF8ej2U2@mid.individual.net> <20240925083451.00003205@gmail.com> <Pascal-20240925164718@ram.dialup.fu-berlin.de> <mdd4j63pmo1.fsf_-_@panix5.panix.com> <oJ-cnQSrLZDYdGX7nZ2dnZfqnPWdnZ2d@earthlink.com> <vdatb6$1l4ch$8@dont-email.me> <vdauah$1lq1u$1@dont-email.me> <20240930110933.00002ec1@gmail.com> <appeal-20240930203239@ram.dialup.fu-berlin.de> <20240930135208.00004170@gmail.com> <OOP-20240930220855@ram.dialup.fu-berlin.de> <20240930162717.0000340b@gmail.com> <polymorphism-20241001105522@ram.dialup.fu-berlin.de> MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Injection-Date: Tue, 01 Oct 2024 16:57:28 +0200 (CEST) Injection-Info: dont-email.me; posting-host="f3a1ced4425b80106d0fe41f21b562dc"; logging-data="2917782"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18BR6zRyBC1Kokifx7SthETLvHgV0cPoZU=" Cancel-Lock: sha1:cDfpp6aDu8MUt1toiVGbAIri4uQ= X-Newsreader: Claws Mail 4.2.0 (GTK 3.24.38; x86_64-w64-mingw32) Bytes: 2204 On 1 Oct 2024 10:02:39 GMT ram@zedat.fu-berlin.de (Stefan Ram) wrote: > Ah! I think this is called "polymorphism". > > I wondered whether something like this could also be formulated in > Pascal. Yes, you can do this in pretty much any functionally-complete language, just as you can implement *any* algorithm; OOP languages are merely intended (emphasis on *intended*) to make it natural and concise.