Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9186
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Hemant-
dc.date.accessioned2014-11-18T11:06:03Z-
dc.date.available2014-11-18T11:06:03Z-
dc.date.issued1990-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9186-
dc.guideGupta, J. P.-
dc.description.abstractThe functional programs are more problem oriented, shorter, easy to enhance and maintain and they generally exhibit more inherent parallelism than the conventional language programs. Due to these striking features functional languages have become the focus of active research and a number of implementations for these languages have been proposed. The current work deals with the design and development of an interpreter for the functional language Hope. The interpreter is developed for IBM-PC using Turbo C as the source language. This interpreter uses strict evaluation mechanism to compute the value of an expression. To be able to define a recursive function by a single conditional expression, the evaluation of 'if' function has been made 'lazy'. The interpreter permits the function definitions with overlapping patterns or patterns containing multiple occurrences of a variable. Dynamic and automatic memory management is employed so that the interpreter makes efficient utilization of memory space. Several examples have been run successfully on the interpreter.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectHOPE INTERPRETERen_US
dc.subjectDYNAMIC AND AUTOMATIC MEMORY MANAGEMENTen_US
dc.subjectMEMORY SPACEen_US
dc.titleDEVELOPMENT OF HOPE INTERPRETERen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number245200en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD245200.pdf2.52 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.