Polytypism and polytypic unification

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/10118
Download file(s):
File Description SizeFormat 
Jansson1995_MSc_thesis.pdfFulltext86.91 kBAdobe PDFView/Open
10118.pdfFulltext86.91 kBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Polytypism and polytypic unification
Authors: Jansson, Patrik
Abstract: This report describes what polytypic programming is, a new system for writing polytypic functions, and a number of useful example functions including generalised versions of map, zip and a specific lazy array based unification algorithm.
Keywords: Teoretisk datalogi;Datalogi;Theoretical computer science;Computer science
Issue Date: 1995
Publisher: Chalmers tekniska högskola / Institutionen för datavetenskap
Chalmers University of Technology / Department of Computer Science
Series/Report no.: Technical report - Department of Computing Science, Chalmers University of Technology and Göteborg University
URI: https://hdl.handle.net/20.500.12380/10118
Collection:Examensarbeten för masterexamen // Master Theses



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