CASL: A Guided Tour of Its Design
暂无分享,去创建一个
[1] Peter D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specification , 1996, Bull. EATCS.
[2] G. Winskel,et al. A Compositional Proof System for the Modal mu-Calculus , 1994 .
[3] Daniel Fridlender,et al. An Interpretation of the Fan Theorem in Type Theory , 1998, TYPES.
[4] Ronald Cramer,et al. Efficient Multiparty Computations with Dishonest Minority , 1998 .
[5] Ulrich Kohlenbach. The Computational Strength of Extensions of Weak König’s Lemma , 1998 .
[6] Anne Elisabeth Haxthausen,et al. Subsorted Partial Higher-Order Locig as an Extension of CASL , 1999, WADT.
[7] Till Mossakowski,et al. Static semantic analysis and theorem proving for CASL , 1997, WADT.
[8] Daniel Fridlender,et al. An n-ary zipWith in Haskell , 1998 .
[9] Wolfgang Reif,et al. The KIV-Approach to Software Verification , 1995, KORSO Book.
[10] Peter D. Mosses,et al. CoFI: The Common Framework Initiative for Algebraic Specification and Development , 2001, Current Trends in Theoretical Computer Science.
[11] Olivier Danvy,et al. An Operational Investigation of the CPS Hierarchy , 1999, ESOP.
[12] Ivan Damgård,et al. On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions , 1998, EUROCRYPT.
[13] Peter D. Mosses. CASL for ASF+SDF Users , 1997 .