Re: Term rewriting and denotation

Article View: comp.lang.functional

Article #295

Back to comp.lang.functional Previous Next

#295

From: Joshua D. Guttman
Date: Tue, 12 Jun 1990 14:56

11 lines
1143 bytes

In article <15421@dime.cs.umass.edu> yodaiken@freal.cs.umass.edu (victor yodaiken) writes:
   This seems like an opportune time to put in a plug for the Primitive
   Recursive arithmetic [1]. 
   While this formal method has received little attention in the c.s.
   community, it has numerous advantages over more widely known methods.

But doesn't PRA have the intrinsic problem that it contains much too small a
set of functions?  EG no "unbounded search" and other sources of partial
recursive functions.  

	Josh

Technical Details

Message-ID: <GUTTMAN.90Jun12105623@darjeeling.mitre.org>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!think!linus!guttman

References:

<3417@rex.cs.tulane.edu> <1555@sys.uea.ac.uk> <15341@dime.cs.umass.edu> <3570@rex.cs.tulane.edu> <15421@dime.cs.umass.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!think!linus!guttman
From: guttman@mitre.org (Joshua D. Guttman)
Newsgroups: comp.lang.functional
Subject: Re: Term rewriting and denotation
Message-ID: <GUTTMAN.90Jun12105623@darjeeling.mitre.org>
Date: 12 Jun 90 14:56:23 GMT
References: <3417@rex.cs.tulane.edu> <1555@sys.uea.ac.uk>
 <15341@dime.cs.umass.edu> <3570@rex.cs.tulane.edu>
 <15421@dime.cs.umass.edu>
Sender: guttman@linus.mitre.org
Organization: Mitre Corporation, Bedford, MA.
Lines: 11
In-reply-to: yodaiken@freal.cs.umass.edu's message of 11 Jun 90 20:41:15 GMT

Reply to Parent Message