Induction on Concurrent Terms

Authors:
Anders Schack-Nielsen
Affiliations:
Programming, Logics and Semantics, IT University of Copenhagen, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 2
Cited 0

Monadic concurrent linear logic programming

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Meta Linear Logical Framework

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers MiniML equipped with a standard big-step semantics and a destination-passing semantics both represented in concurrent LF (CLF) and prove the two semantics equivalent. The proof is then examined yielding insights into the issues concerning induction on concurrent terms. We conclude by outlining some of the difficulties that one will need to address when designing a meta-logic for CLF.