Re: Pattern matching and abstraction

Article View: comp.lang.functional

Article #294

Back to comp.lang.functional Previous Next

#294

From: Richard A. O'Keefe
Date: Tue, 12 Jun 1990 09:22

11 lines
1049 bytes

In article <15189@dime.cs.umass.edu>, pop@cs.umass.edu writes:
> [By the way, one
> piece of syntactic sugar that might be good in functional programming is to
> have natural numbers as a type, and treat  x+1  as syntactic sugar for
> succ(x), since structural induction then works nicely over the natural
> numbers, following Burstall and Darlington].

Haskell has it.
-- 
"A 7th class of programs, correct in every way, is believed to exist by a
few computer scientists.  However, no example could be found to include here."

Technical Details

Message-ID: <3225@goanna.cs.rmit.oz.au>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!ames!uhccux!munnari.oz.au!goanna!ok

References: <2584@skye.ed.ac.uk> <3077@goanna.cs.rmit.oz.au> <15189@dime.cs.umass.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!ames!uhccux!munnari.oz.au!goanna!ok
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.functional
Subject: Re: Pattern matching and abstraction
Keywords: pattern matching closures constructors destructors
Message-ID: <3225@goanna.cs.rmit.oz.au>
Date: 12 Jun 90 09:22:06 GMT
References: <2584@skye.ed.ac.uk> <3077@goanna.cs.rmit.oz.au> <15189@dime.cs.umass.edu>
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 11

Reply to Parent Message