Four Complete Datatype Defining Rewrite Systems for an Abstract Datatype of Natural Numbers
暂无分享,去创建一个
[1] Jan A. Bergstra,et al. Inversive meadows and divisive meadows , 2009, J. Appl. Log..
[2] Jan A. Bergstra,et al. Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals , 2014, ArXiv.
[3] Jan A. Bergstra,et al. Algebraic Specifications of Computable and Semicomputable Data Types , 1987, Theor. Comput. Sci..
[4] Martin Wirsing,et al. Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[5] Manfred Broy,et al. A Systematic Study of Models of Abstract Data Types , 1984, Theor. Comput. Sci..
[6] Jan A. Bergstra,et al. Proposition algebra , 2008, TOCL.
[7] Jan A. Bergstra,et al. Short-circuit logic , 2010, ArXiv.
[8] Marie-Claude Gaudel,et al. Testing Algebraic Data Types and Processes: A Unifying Theory , 1998, Formal Aspects of Computing.
[9] Jan A. Bergstra,et al. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras , 1995, JACM.
[10] Jan A. Bergstra,et al. A propositional logic with 4 values: true, false, divergent and meaningless , 1995, J. Appl. Non Class. Logics.
[11] Jan A. Bergstra,et al. The rational numbers as an abstract data type , 2007, JACM.
[12] Jan A. Bergstra,et al. Thread algebra for strategic interleaving , 2007, Formal Aspects of Computing.