The choice calculus : a formal language of variation Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/k643b3668

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In this thesis I present the choice calculus, a formal language for representing variation in software and other structured artifacts. The choice calculus is intended to support variation research in a way similar to the lambda calculus in programming language research. Specifically, it provides a simple formal basis for presenting, proving, and communicating theoretical results. It can serve as a common language of discourse for researchers working on different views of similar problems and provide a shared back end in tools. This thesis collects a large amount of work on the choice calculus. It defines the syntax and denotational semantics of the language along with modular language extensions that add features important to variation research. It presents several theoretical results related to the choice calculus, such as an equivalence relation that supports semantics-preserving transformations of choice calculus expressions, and a type system for ensuring that an expression is well formed. It also presents a Haskell DSEL based on the choice calculus for exploring the concept of variational programming.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2013-07-17T19:48:07Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) Thesis.pdf: 848621 bytes, checksum: 1f4476bc4bffb098826dc9e0b04e5540 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2013-07-02T17:34:32Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) Thesis.pdf: 848621 bytes, checksum: 1f4476bc4bffb098826dc9e0b04e5540 (MD5)
  • description.provenance : Submitted by Eric Walkingshaw (walkinge@onid.orst.edu) on 2013-07-01T21:03:13Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) Thesis.pdf: 848621 bytes, checksum: 1f4476bc4bffb098826dc9e0b04e5540 (MD5)
  • description.provenance : Made available in DSpace on 2013-07-17T19:48:07Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) Thesis.pdf: 848621 bytes, checksum: 1f4476bc4bffb098826dc9e0b04e5540 (MD5) Previous issue date: 2013-06-13

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items