IFL: AN INTERMEDIATE CODE FOR FUNCTIONAL LANGUAGES

Simple item page
dc.contributor.authorSimpson, Toddeng
dc.date.accessioned2008-05-23T21:22:43Z
dc.date.available2008-05-23T21:22:43Z
dc.date.computerscience1999-05-27eng
dc.date.issued1989-01-01eng
dc.description.abstractFunctional Languages all share the lambda calculus as a common basis. Existing intermediate functional languages are simple extensions of the lambda calculus to include let and letrec constructs. This paper proposes a more extensive intermediate language which supports simple data types, pattern matching, and interactive environments. Motivation, design considerations, semantics, and progress to date are included.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1989-342-04eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31320
dc.identifier.urihttp://hdl.handle.net/1880/46576
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleIFL: AN INTERMEDIATE CODE FOR FUNCTIONAL LANGUAGESeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1989-342-04.pdf
Size:
2.28 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications