Type and Effect Systems
暂无分享,去创建一个
[1] HanneRiisNielson ComputerScienceDepartment. From Cml to Process Algebras , 1993 .
[2] Flemming Nielson,et al. Communication Analysis for Concurrent ML , 1997 .
[3] Nick Benton. Strictness Logic and Polymorphic Invariance , 1992, LFCS.
[4] Andrew K. Wright. Typing References by Effect Inference , 1992, ESOP.
[5] Thomas P. Jensen,et al. Disjunctive strictness analysis , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[6] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[7] Matthias Felleisen,et al. A Syntactic Approach to Type Soundness , 1994, Inf. Comput..
[8] Flemming Nielson,et al. Type and Behaviour Reconstruction for Higher-Order Concurrent Programs , 1997, J. Funct. Program..
[9] Jon G. Riecke,et al. The SLam calculus: programming with secrecy and integrity , 1998, POPL '98.
[10] Pierre Jouvelot,et al. The Type and Effect Discipline , 1994, Inf. Comput..
[11] Lars Birkedal,et al. A region inference algorithm , 1998, TOPL.
[12] John C. Mitchell,et al. Type inference with simple subtypes , 1991, Journal of Functional Programming.
[13] Mads Tofte,et al. Type Inference for Polymorphic References , 1990, Inf. Comput..
[14] Flemming Nielson,et al. Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics , 1996, LOMAPS.
[15] Flemming Nielson,et al. Behaviour Analysis and Safety Conditions: A Case Study in CML , 1998, FASE.
[16] Flemming Nielson,et al. Layered Predicates , 1992, REX Workshop.
[17] Flemming Nielson,et al. Type and effect systems - behaviours for concurrency , 1999 .
[18] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.
[19] Pierre Jouvelot,et al. Algebraic reconstruction of types and effects , 1991, POPL '91.
[20] Pierre Jouvelot,et al. Reasoning about continuations with control effects , 1989, PLDI '89.
[21] Flemming Nielson,et al. Polymorphic Subtyping for Effect Analysis: The Algorithm , 1996, LOMAPS.
[22] Ryan Stansifer,et al. Type inference with subtypes , 1988, POPL '88.
[23] Thomas P. Jensen,et al. Strictness Analysis in Logical Form , 1991, FPCA.
[24] Flemming Nielson,et al. Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.
[25] Karl-Filip Faxén. Polyvariance, Polymorphism and Flow Analysis , 1996, LOMAPS.
[26] Mads Tofte,et al. Region-based Memory Management , 1997, Inf. Comput..
[27] Nick Benton,et al. Strictness Properties of Lazy Algebraic Datatypes , 1993, WSA.
[28] Nevin Heintze,et al. Control-Flow Analysis and Type Systems , 1995, SAS.
[29] Flemming Nielson,et al. Principles of Program Analysis , 1999, Springer Berlin Heidelberg.
[30] Flemming Nielson,et al. From CML to its Process Algebra , 1996, Theor. Comput. Sci..
[31] Fritz Henglein,et al. Polymorphic Binding-Time Analysis , 1994, ESOP.
[32] Pierre Jouvelot,et al. Semantic parallelization: a practical exercise in abstract interpretation , 1987, POPL '87.
[33] Mitchell Wand,et al. Specifying the correctness of binding-time analysis , 1993, POPL '93.
[34] Flemming Nielson,et al. Abstract interpretation: a semantics-based tool for program analysis , 1995, LICS 1995.
[35] A. P. Ershov,et al. A Formal Type System for Comparing Partial Evaluators , 1988 .
[36] Karl-Filip Faxén,et al. Optimizing Lazy Functional Programs Using Flow Inference , 1995, SAS.
[37] Prateek Mishra,et al. Polymorphic Subtype Inference: Closing the Theory-Practice Gap , 1989, TAPSOFT, Vol.2.
[38] Mark P. Jones. A Theory of Qualified Types , 1992, ESOP.
[39] Flemming Nielson,et al. Polymorphic Subtyping for Effect Analysis: The Static Semantics , 1996, LOMAPS.