Substructural Type Systems for Program Analysis Export

@incollection{citeulike:2839601, abstract = {Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contraction rules are restricted, and ordered type systems, where the exchange rule is also restricted. Those type systems turned out to be very useful for reasoning about temporal properties of programs, like a memory cell is deallocated only once, or a memory cell is never read or written after it is deallocated. In this talk, I will focus on substructural type systems for program analysis, and review their principles and applications [1,2,3,4,5]. I will also discuss some emerging techniques and future directions of substructural-type-based program analysis.}, author = {Kobayashi, Naoki}, citeulike-article-id = {2839601}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-78969-7_3}, comment = {via http://d.hatena.ne.jp/syd\_syd/20080416\#p1 ---=note-separator=--- slide: http://www.kb.ecei.tohoku.ac.jp/\~{}koba/slides/FLOPS2008.pdf}, doi = {10.1007/978-3-540-78969-7_3}, journal = {Functional and Logic Programming}, keywords = {program-analysis, type-theory}, pages = {14}, posted-at = {2008-05-28 23:48:42}, priority = {4}, title = {Substructural Type Systems for Program Analysis}, url = {http://dx.doi.org/10.1007/978-3-540-78969-7_3}, year = {2008} }

TY - CHAP ID - citeulike:2839601 L3 - citeulike-article-id:2839601 N2 - Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contraction rules are restricted, and ordered type systems, where the exchange rule is also restricted. Those type systems turned out to be very useful for reasoning about temporal properties of programs, like a memory cell is deallocated only once, or a memory cell is never read or written after it is deallocated. In this talk, I will focus on substructural type systems for program analysis, and review their principles and applications [1,2,3,4,5]. I will also discuss some emerging techniques and future directions of substructural-type-based program analysis. JF - Functional and Logic Programming EP - 14 TI - Substructural Type Systems for Program Analysis SP - 14 KW - program-analysis KW - type-theory N1 - via http://d.hatena.ne.jp/syd_syd/20080416#p1 N1 - slide: http://www.kb.ecei.tohoku.ac.jp/~koba/slides/FLOPS2008.pdf AU - Kobayashi, Naoki PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-78969-7_3 ER -