Re: simple vs complex languages

nmm1@cus.cam.ac.uk (Nick Maclaren)
5 Jun 2003 22:52:34 -0400

          From comp.compilers

Related articles
[30 earlier articles]
Re: simple vs complex languages zivca@netvision.net.il (2003-05-29)
Re: simple vs complex languages vbdis@aol.com (2003-06-03)
Re: simple vs complex languages vbdis@aol.com (2003-06-03)
Re: simple vs complex languages bear@sonic.net (2003-06-03)
Re: simple vs complex languages lars@bearnip.com (2003-06-03)
Re: simple vs complex languages jvorbrueggen@mediasec.de (Jan C.=?iso-8859-1?Q?Vorbr=FCggen?=) (2003-06-05)
Re: simple vs complex languages nmm1@cus.cam.ac.uk (2003-06-05)
Re: simple vs complex languages nmm1@cus.cam.ac.uk (2003-06-05)
Re: simple vs complex languages chase@TheWorld.com (David Chase) (2003-06-05)
Re: simple vs complex languages adamo+news@dblab.ece.ntua.gr (Yiorgos Adamopoulos) (2003-06-05)
Re: simple vs complex languages david.thompson1@worldnet.att.net (Dave Thompson) (2003-06-05)
Re: simple vs complex languages lex@cc.gatech.edu (Lex Spoon) (2003-06-05)
Re: simple vs complex languages zivca@netvision.net.il (2003-06-08)
[2 later articles]
| List of all articles for this month |

From: nmm1@cus.cam.ac.uk (Nick Maclaren)
Newsgroups: comp.compilers
Date: 5 Jun 2003 22:52:34 -0400
Organization: University of Cambridge, England
References: 03-05-198 03-06-006
Keywords: design
Posted-Date: 05 Jun 2003 22:52:34 EDT

vbdis@aol.com (VBDis) writes:
|> nmm1@cus.cam.ac.uk (Nick Maclaren) schreibt:
|>
|> >There are a fair number of languages around where a function doesn't
|> >have to exist even when it is called, and a missing function will be
|> >automatically converted into some other construction (e.g. a call to
|> >an external program). This can be useful, as any shell programmer can
|> >witness :-)
|>
|> And the user has to pray each time before running such a program,
|> because nobody can tell him what it /will/ do. Such code can only give
|> hints on what the program /should/ do... ;-)


Yes. You always have to pay something for flexibility and
functionality. My view of such languages is that such 'external'
calls are best modelled in the same way as interactive human input.
I.e. you can constrain and check them as for what the user types, but
you have to regard them as completely unpredictable beyond what you
have constrained or checked.


Constraining the syntax is standard technology, and I remember some
people working on languages a couple of decades back that did some
limited constraining of the semantics - e.g. a function (or even
program) had to declare what exceptions it might raise and what
resources it might use (both of which CAN be checked). Does anyone
know if anything came of that?


Regards,
Nick Maclaren.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.