A Type System for Bounded Space and Functional In-Place Update

@article{Hofmann2000ATS,
  title={A Type System for Bounded Space and Functional In-Place Update},
  author={M. Hofmann},
  journal={Nord. J. Comput.},
  year={2000},
  volume={7},
  pages={258-289}
}
  • M. Hofmann
  • Published 2000
  • Computer Science
  • Nord. J. Comput.
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for writing C-code in a functional style and as a compilation process from linearly typed first-order functional programs into malloc()-free C code. The main technical result is the correctness of this compilation. The crucial innovation over previous linear typing schemes consists of the introduction of a resource type… Expand
Heap-Bounded Assembly Language
Typing with Conditions and Guarantees for Functional In-place Update
Another Type System for In-Place Update
A Linearly Typed Assembly Language
Typing with Conditions and Guarantees in LFPL
Amortized Heap-Space Analysis for First-Order Functional Programs
A Transformational Approach which Combines Size Inference and Program Optimization
Refinement through restraint: bringing down the cost of verification
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Lively linear Lisp: “look ma, no garbage!”
Purely functional data structures
Operational aspects of linear lambda calculus
  • P. Lincoln, J. Mitchell
  • Mathematics, Computer Science
  • [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
Region-based Memory Management
Reference Counting as a Computational Interpretation of Linear Logic
A region inference algorithm
Syntactic control of interference
Resource bound certification
...
1
2
3
4
...