Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell

Простая страница элемента
dc.creatorVasconcellos,Cristiano
dc.creatorFigueiredo,Lucília
dc.creatorCamarão,Carlos
dc.date2003
dc.date.accessioned2024-02-06T12:52:32Z
dc.date.available2024-02-06T12:52:32Z
dc.descriptionThis paper describes a practical type inference algorithm for typing poly-morphic and possibly mutually recursive definitions, using Haskell to provide a high-level implementation of the algorithm.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-009-08-0873
dc.identifierhttps://lib.jucs.org/article/28089/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8388
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 9(8): 873-890
dc.subjectprogramming languages
dc.subjecttype inference
dc.subjectpolymorphic recursion
dc.titlePractical Type Inference for Polymorphic Recursion: an Implementation in Haskell
dc.typeResearch Article
Файлы
Коллекции