A new approach to recursive programs.

Add Circle Remove Circle Resize Small Custom Fullscreen
Available Online:
https://purl.stanford.edu/rc624hz6654
Title:
A new approach to recursive programs.
Relation:
Stanford University. Libraries. Department of Special Collections and University Archives3840/2https://purl.stanford.edu/rc624hz6654, Stanford University, Department of Computer Science, Technical Reports, and Stanford Artificial Intelligence Laboratory records, 1963-2009
PublishDate:
2021-02-05T23:26:53Z
Description:
In this paper we critically evaluate the classical least-fixedpoint approach towards recursive programs. We suggest a new approach which extracts the maximal amount of valuable information embedded in the programs. The presentation is informal, with emphasis on examples.
Identifier:
CS-TR-1975-539
Contributor:
Manna, Zohar (autAuthor) and Shamir, Adi (autAuthor)
Type:
Text and technical reports
Date:
1975-12-01
Language:
engEnglish
Format:
1 text file, technical reports, and image/jpeg
Subject:
Stanford University. Computer Science Department and Computer science
Thumbnail:
{data={format=image/jpeg, width=312, @id=https://stacks.stanford.edu/image/iiif/rc624hz6654%2Frc624hz6654_01/full/!400,400/0/default.jpg, @type=dctypes:Image, service={data={@context=http://iiif.io/api/image/2/context.json, @id=https://stacks.stanford.edu/image/iiif/rc624hz6654%2Frc624hz6654_01, profile=http://iiif.io/api/image/2/level2.json}}, height=400}}
Exhibit Tags:
Technical Report