Witnessing Purity, Constancy and Mutability

Authors:
Ben Lippmeier
Affiliations:
Department of Computer Science, Australian National University,
Venue:
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Year:
2009

Citing 10
Cited 1

An overview of the Edinburgh logical framework

Current trends in hardware verification and automated theorem proving
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy functional state threads

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Bridging the gulf: a common intermediate language for ML and Haskell

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed memory management in a calculus of capabilities

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The marriage of effects and monads

ACM Transactions on Computational Logic (TOCL)
Optimizing ML Using a Hierarchy of Monadic Types

TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Semantics of an effect analysis for exceptions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
System F with type equality coercions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Relational semantics for effect-based program transformations with dynamic allocation

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming

Programming and reasoning with algebraic effects and dependent types

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it easier to reason about program behaviour during transformation, but the lack of polymorphism reduces the expressiveness of the language. We present a System-F style core language that uses dependently kinded proof witnesses to encode information about the mutability of values and the purity of computations. We support mixed strict and lazy evaluation, and use our type system to ensure that only computations without visible side effects are suspended.