https://github.com/wenkokke/paper-races-in-classical-linear-logic

wherein I describe deadlock and race-free session types with non-determinism
https://github.com/wenkokke/paper-races-in-classical-linear-logic

non-determinism paper process-calculus races type-system

Last synced: 5 days ago
JSON representation

wherein I describe deadlock and race-free session types with non-determinism

• Host: GitHub
• URL: https://github.com/wenkokke/paper-races-in-classical-linear-logic
• Owner: wenkokke
• License: mit
• Archived: true
• Created: 2016-12-11T20:26:14.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2020-09-29T17:13:41.000Z (about 4 years ago)
• Last Synced: 2024-11-10T15:15:48.768Z (5 days ago)
• Topics: non-determinism, paper, process-calculus, races, type-system
• Language: Agda
• Homepage:
• Size: 9.29 MB
• Stars: 4
• Watchers: 4
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Nodcap: Races in Classical Linear Logic

This repository holds the code for Nodcap. Nodcap is a type system for the

π-calculus which was inspired by bounded linear logic, and an extension of the

type system CP by Phil Wadler. CP guarantees that any program it assigns a type

will be free of races and deadlocks. What sets Nodcap apart from CP is that it

allows non-determinism, and as such permits programs with races, but it does

this without losing its strong ties to classical linear logic or the guarantee

not to deadlock. 

The directory src/cpnd1 contains a formalisation of Non-deterministic CP in Agda, implementing a cut-elimination proof, showing preservation, progress, and termination.