The essence of monotonic state

TLDI'11 - Proceedings of the 7th ACM SIGPLAN Workshop on Types in Language Design and Implementation

Volumn , Issue , 2011, Pages 73-86

  Pilkiewicz, Alexandre ^a   Pottier, François ^a  

^a INRIA   (France)

Author keywords

Amortized complexity; Capabilities; Hash consing; Hidden state; Mono tonic state; Specification; Thunks; Type based complexity checking; Types

Indexed keywords

AMORTIZED COMPLEXITY; CAPABILITIES; HASH-CONSING; HIDDEN STATE; MONO-TONIC STATE; THUNKS; TYPE-BASED COMPLEXITY-CHECKING; TYPES;

SPECIFICATIONS;

EID: 79952126795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1929553.1929565     Document Type: Conference Paper

References (32)

1. Amal Ahmed, Derek Dreyer, and Andreas Rossberg. State-dependent representation independence. In ACM Symposium on Principles of Programming Languages (POPL), pages 340-353, January 2009.
2. Robert Atkey. Amortised resource analysis with separation logic. In European Symposium on Programming (ESOP), volume 6012 of Lecture Notes in Computer Science, pages 85-103. Springer, 2010.
3. Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. In ACM International Conference on Functional Programming (ICFP), pages 213-224, September 2008.
4. Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. In ACM Symposium on Principles of Programming Languages (POPL), pages 262-275, January 1999.
5. Karl Crary and Stephanie Weirich. Resource bound certification. In ACM Symposium on Principles of Programming Languages (POPL), pages 184-198, January 2000.
6. Nils Anders Danielsson. Lightweight semiformal time complexity analysis for purely functional data structures. In ACM Symposium on Principles of Programming Languages (POPL), January 2008.
7. Mike Dodds, Xinyu Feng, Matthew J. Parkinson, and Viktor Vafeiadis. Deny-guarantee reasoning. In European Symposium on Programming (ESOP), volume 5502 of Lecture Notes in Computer Science, pages 363-377. Springer, March 2009.
8. Vincent Dornic, Pierre Jouvelot, and David K. Gifford. Polymorphic time systems for estimating program complexity. ACM Letters on Programming Languages and Systems, 1(1):33-45, 1992. (Pubitemid 23614062)
9. Derek Dreyer, Georg Neis, and Lars Birkedal. The impact of higher-order state and control effects on local relational reasoning. In ACM International Conference on Functional Programming (ICFP), pages 143-156, September 2010.
10. Manuel Fähndrich and Rustan Leino. Heap monotonic typestates. In International Workshop on Alias Confinement and Ownership (IWACO), July 2003.
11. Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, and Mooly Sagiv. Local reasoning for storable locks and threads. Technical Report MSR-TR-2007-39, Microsoft Research, September 2007.
12. Eric C. R. Hehner. Abstractions of Time, pages 191-210. Prentice Hall, 1994.
13. Aquinas Hobor, Andrew W. Appel, and Francesco Zappa Nardelli. Oracle semantics for concurrent separation logic. In European Symposium on Programming (ESOP), volume 4960 of Lecture Notes in Computer Science, pages 353-367. Springer, April 2008.
14. Martin Hofmann. A type system for bounded space and functional in-place update. Nordic Journal of Computing, 7(4):258-289, 2000.
15. Gary T. Leavens and Albert L. Baker. Enhancing the pre- and postcondition technique for more expressive specifications. In Formal Methods (FM), volume 1709 of Lecture Notes in Computer Science, pages 1087-1106. Springer, January 1999.
16. Gary T. Leavens, Erik Poll, Curtis Clifton, Yoonsik Cheon, Clyde Ruby, David Cok, Peter Müller, Joseph Kiniry, Patrice Chalin, and Daniel M. Zimmerman. JML Reference Manual, May 2008.
17. K. Rustan M. Leino and Wolfram Schulte. Using history invariants to verify observers. In European Symposium on Programming (ESOP), volume 4421 of Lecture Notes in Computer Science, pages 80-94. Springer, 2007. (Pubitemid 350259485)
18. Barbara Liskov and Jeannette M. Wing. A behavioral notion of sub-typing. ACM Transactions on Programming Languages and Systems, 16(6):1811-1841, 1994.
19. Karl Mazurak, Jianzhou Zhao, and Steve Zdancewic. Lightweight linear types in system F°. In Workshop on Types in Language Design and Implementation (TLDI), pages 77-88, January 2010.
20. Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, and Lars Birkedal. Abstract predicates and mutable ADTs in Hoare type theory. In European Symposium on Programming (ESOP), volume 4421 of Lecture Notes in Computer Science, pages 189-204. Springer, March 2007. (Pubitemid 350259492)
21. Peter W. O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 375(1-3):271-307, May 2007.
22. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1999.
23. Benjamin C. Pierce and David N. Turner. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming, 4(2):207-247, April 1994.
24. François Pottier. Hiding local state in direct style: a higher-order anti-frame rule. In IEEE Symposium on Logic in Computer Science (LICS), pages 331-340, June 2008.
25. François Pottier. Generalizing the higher-order frame and anti-frame rules. Unpublished, July 2009.
26. François Pottier. Three comments on the anti-frame rule. Unpublished, July 2009.
27. Brian Reistad and David K. Gifford. Static dependent costs for estimating execution time. In ACM Symposium on Lisp and Functional Programming (LFP), pages 65-78, 1994.
28. Fred B. Schneider. On Concurrent Programming. Springer, 1997.
29. Frederick Smith, David Walker, and Greg Morrisett. Alias types. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 366-381. Springer, March 2000.
30. Eijiro Sumii. A complete characterization of observational equivalence in polymorphic lambda-calculus with general references. In Computer Science Logic, volume 5771 of Lecture Notes in Computer Science, pages 455-469. Springer, September 2009.
31. Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, 1985.
32. Hongwei Xi. Dependent ML: an approach to practical programming with dependent types. Journal of Functional Programming, 17(2):215-286, 2007.