Polytypism and polytypic unification

Visa enkel post
dc.contributor.authorJansson, Patrik
dc.contributor.departmentChalmers tekniska högskola / Institutionen för datavetenskapsv
dc.contributor.departmentChalmers University of Technology / Department of Computer Scienceen
dc.date.accessioned2019-07-03T14:14:40Z
dc.date.available2019-07-03T14:14:40Z
dc.date.issued1995
dc.description.abstractThis 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.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/10118
dc.language.isoeng
dc.relation.ispartofseriesTechnical report - Department of Computing Science, Chalmers University of Technology and Göteborg University
dc.setspec.uppsokTechnology
dc.subjectTeoretisk datalogi
dc.subjectDatalogi
dc.subjectTheoretical computer science
dc.subjectComputer science
dc.titlePolytypism and polytypic unification
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
Ladda ner
Original bundle
Visar 1 - 2 av 2
Bild (thumbnail)
Namn:
Jansson1995_MSc_thesis.pdf
Storlek:
86.91 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Bild (thumbnail)
Namn:
10118.pdf
Storlek:
86.91 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen