Master's Thesis: Modeling Call-Time Choice as Effect using Scoped Free Monads

This repository contains the code presented in Modeling Call-Time Choice as Effect using Scoped Free Monads. The initial motivation and goals can be found here.

Structure

The directory structure is as follows.

Coq: Two approaches to modeling call-time choice semantics in Coq.
1. Fully functional implementation which uses explicit scope delimiters
2. Higher-Order version without lifted recursive data types
Curry: Sharing test suite as well as permutation sort and QuickSort examples
Haskell: Three approaches to modeling call-time choice semantics in Haskell.
1. Explicit scope delimiters
2. Higher-Order
3. Hybrid (does not work, kept for documentation purposes)
Presentation: LaTeX source for slides of proposal and final presentation
Thesis: LaTeX source for thesis

More detailed information about the contents of a directory can be found in the respective README file.

The code can be compiled with the following tools.

Name		Name	Last commit message	Last commit date
Latest commit History 301 Commits
Coq		Coq
Curry/src		Curry/src
Haskell/src		Haskell/src
Presentation		Presentation
Thesis		Thesis
.gitignore		.gitignore
Goals.md		Goals.md
README.md		README.md