Supercombinator based implementation of lazy functional programming languages

dc.contributor.advisor	Priti Shankar
dc.contributor.author	Mendhekar, Anurag D
dc.date.accessioned	2025-10-30T10:57:30Z
dc.date.available	2025-10-30T10:57:30Z
dc.date.submitted	1991
dc.identifier.uri	https://etd.iisc.ac.in/handle/2005/7266
dc.description.abstract	Functional languages are becoming popular for the ease of programming that they facilitate. The implementation of a class of these languages is described. A method for compile-time detection of potential garbage in one such implementation is presented. The runtime mechanism to free this garbage and the necessary compile-time analysis are described along with the results of the implementation.
dc.language.iso	en_US
dc.relation.ispartofseries	T03159
dc.rights	I grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation
dc.subject	Dotsenko Model
dc.subject	Time-Delayed Synapses
dc.subject	Hierarchical Storage
dc.title	Supercombinator based implementation of lazy functional programming languages
dc.degree.name	MSc Engg
dc.degree.level	Masters
dc.degree.grantor	Indian Institute of Science
dc.degree.discipline	Engineering