Partial Categorical Multi-Combinators and Church-Rosser Theorems

Простая страница элемента
dc.creatorLins,Rafael
dc.date2004
dc.date.accessioned2024-02-06T12:53:08Z
dc.date.available2024-02-06T12:53:08Z
dc.descriptionCategorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Categorical Multi-Combinators consists of only four rewriting laws with a very low pattern-matching complexity. This system allows the equivalent of several -reductions to be performed at once, as functions form frames with all their arguments. Although this feature is convenient for most cases of function application it does not allow partially parameterised functions to fetch arguments. This paper presents Partial Categorical Multi-Combinators, a new rewriting system, which removes this drawback.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-010-07-0769
dc.identifierhttps://lib.jucs.org/article/28255/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8590
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 10(7): 769-788
dc.subjectfunctional programming
dc.subjectcategorical combinators
dc.subjectexplicit substitutions
dc.titlePartial Categorical Multi-Combinators and Church-Rosser Theorems
dc.typeResearch Article
Файлы
Коллекции