메뉴 건너뛰기




Volumn , Issue , 2005, Pages 78-91

A step-indexed model of substructural state

Author keywords

Mutable references; Stepindexed model; Substructural type system

Indexed keywords

COMMON MODELS; DE-ALLOCATION; MUTABLE REFERENCES; OPERATIONAL SEMANTICS; SEMANTIC INTERPRETATION; SUBSTRUCTURAL TYPE SYSTEMS; TYPE SYSTEMS;

EID: 33745792393     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1086365.1086376     Document Type: Conference Paper
Times cited : (17)

References (33)
  • 7
    • 0038559204 scopus 로고    scopus 로고
    • An indexed model of recursive types for foundational proof-carrying code
    • September
    • Andrew W. Appel and David McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems, 23(5):657-683, September 2001.
    • (2001) ACM Transactions on Programming Languages and Systems , vol.23 , Issue.5 , pp. 657-683
    • Appel, A.W.1    McAllester, D.2
  • 10
    • 84976797469 scopus 로고
    • Lively linear LISP-look ma, no garbage
    • Henry Baker. Lively linear LISP-look ma, no garbage. ACM SIGPLAN Notices, 27(8):89-98, 1992.
    • (1992) ACM SIGPLAN Notices , vol.27 , Issue.8 , pp. 89-98
    • Baker, H.1
  • 18
    • 84947213533 scopus 로고    scopus 로고
    • A type system for bounded space and functional in-place update
    • March
    • Martin Hofmann. A type system for bounded space and functional in-place update. In Proc. European Symposium on Programming (ESOP), pages 165-179, March 2000.
    • (2000) Proc. European Symposium on Programming (ESOP) , pp. 165-179
    • Hofmann, M.1
  • 24
    • 0000169374 scopus 로고    scopus 로고
    • From Algol to polymorphic linear lambda-calculus
    • Peter W. O'Hearn and John C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the ACM, 47(1):167-223, 2000.
    • (2000) Journal of the ACM , vol.47 , Issue.1 , pp. 167-223
    • O'hearn, P.W.1    Reynolds, J.C.2
  • 25
    • 0036051192 scopus 로고    scopus 로고
    • Separation logic: A logic for shared mutable data structures
    • July
    • John C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In Proc. Logic in Computer Science (LICS), pages 55-74, July 2002.
    • (2002) Proc. Logic in Computer Science (LICS) , pp. 55-74
    • Reynolds, J.C.1
  • 26
    • 21744433110 scopus 로고
    • Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
    • volume 776 of Lecture Notes in Computer Science. Springer-Verlag
    • Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, and Rinus J. Plasmeijer. Guaranteeing safe destructive updates through a type system with uniqueness information for graphs. In Dagstuhl Seminar on Graph Transformations in Computer Science, volume 776 of Lecture Notes in Computer Science, pages 358-379. Springer- Verlag, 1994.
    • (1994) Dagstuhl Seminar on Graph Transformations in Computer Science , pp. 358-379
    • Smetsers, S.1    Barendsen, E.2    Marko, C.3    Van Eekelen, J.D.4    Plasmeijer, R.J.5
  • 29
    • 0003232884 scopus 로고
    • Linear types can change the world!
    • April. IFIP TC 2 Working Conference
    • Philip Wadler. Linear types can change the world! In Programming Concepts and Methods, April 1990. IFIP TC 2 Working Conference.
    • (1990) Programming Concepts and Methods
    • Wadler, P.1
  • 30
    • 33646131583 scopus 로고    scopus 로고
    • Substructural type systems
    • Benjamin Pierce, editor, chapter 1. MIT Press, Cambridge, MA
    • DavidWalker. Substructural type systems. In Benjamin Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 1, pages 3-43. MIT Press, Cambridge, MA, 2005.
    • (2005) Advanced Topics in Types and Programming Languages , pp. 3-43
    • Walker, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.