Path: csiph.com!1.us.feeder.erje.net!feeder.erje.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: antispam@math.uni.wroc.pl Newsgroups: comp.compilers Subject: Re: Languages with types like Ada Date: Fri, 21 Oct 2022 12:30:01 -0000 (UTC) Organization: Aioe.org NNTP Server Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-10-037@comp.compilers> References: <22-10-034@comp.compilers> Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="8360"; mail-complaints-to="abuse@iecc.com" Keywords: types Posted-Date: 21 Oct 2022 13:44:57 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:3207 Luke A. Guest wrote: > Hi, > > I've been using Ada for a while and I cannot seem to find any other > languages which were developed which had a similar/same way of embedding > information into types (including basic discrete types). Are there any? > > And no, i don't mean Pascal. I mean a fully fledged type system like Ada's. You probably should be clearer here. IMO distinctive feature of Ada types is having parametrized types. IIUC Ada essentially the same mechanism is available in (Extended) Pascal. More general version of parameterised types was in CLU. FriCAS computer algebra system has its own language called Spad, having very general parameterised types. If you like Ada you probably will reject Spad generality, but all above came from similar design considerations. Concerning "fully fledged type system", this is really an invitation to a flame war. You should say which features of Ada type system you want. And if you want enough features to be exactly the same as in Ada, then Ada is likely the only language with this features. After all, what is purpose of developing a "new" language when it is exactly the same as an existing language (OK, you may do this due to copyright/trademarks). -- Waldek Hebisch