dissertation · eScholarship@McGill (McGill) · 2016

Programming infinite structures using copatterns

Thibodeau, David

Cited by 0Open access

Abstract

Infinite structures are an integral part of computer science as they serve as representations for concepts such as constantly running devices and processes or data communication streams.Due to their importance, it is crucial that programming languages are equipped with adequate means to encode and reason about infinite structures.This thesis investigates the recent idea of copatterns, a device to represent infinite structures in a fashion dual to usual definitions of finite data, by integrating it to Levy's Call-by-Push Value language.We define a coverage algorithm for copattern matching definitions.We prove that evaluation preserves types and that well-typed terms do not get stuck.We define a translation from our language to Levy's and prove that this translation preserves evaluation.

Cite this paper

APA 7

Thibodeau, D. (2016). Programming infinite structures using copatterns. eScholarship@McGill (McGill).

MLA 9

Thibodeau, David. “Programming infinite structures using copatterns.” eScholarship@McGill (McGill), 2016.

Chicago

Thibodeau, David. 2016. “Programming infinite structures using copatterns.” eScholarship@McGill (McGill).

Harvard

Thibodeau, D. (2016) ‘Programming infinite structures using copatterns’, eScholarship@McGill (McGill).

BibTeX

@phdthesis{thibodeau2016programming,
  title = {{Programming infinite structures using copatterns}},
  author = {Thibodeau, David},
  school = {eScholarship@McGill (McGill)},
  year = {2016}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.