References

1. Egidio Astesiano, Michel Bidoit, Hélène Kirchner, Bernd Krieg-Brückner, Peter D. Mosses, Donald Sannella & Andrzej Tarlecki (2002): CASL: the Common Algebraic Specification Language. Theor. Comput. Sci. 286(2), pp. 153–196.
2. Jon Barwise & Yanis Moschovakis (1978): Global inductive definability. Journal of Symbolic Logic 43, pp. 521–534.
3. Samuel Buss (1986): Bounded Arithmetic. Bibliopolis, Naples.
4. Gilles Dowek, Thérèse Hardin & Claude Kirchner (2003): Theorem Proving Modulo. J. Autom. Reasoning 31(1), pp. 33–72.
5. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara & Jan Willem Klop (2007): Productivity of Stream Definitions. In: Erzsébet Csuhaj-Varjú & Zoltán Ésik: FCT, Lecture Notes in Computer Science 4639. Springer, pp. 274–287, doi:10.1007/978-3-540-74240-1_24.
6. Ronald Fagin (1974): Generalized first order spectra and polynomial time recognizable sets. In: R. Karp: Complexity of Computation. SIAM-AMS, pp. 43–73.
7. Neil Immerman (1989): Descriptive and Computational Complexity. In: FCT, pp. 244–245.
8. N.G. Jones & A.L. Selman (1974): Turing machines and the spectra of first-order formulas. Journal of Symbolic Logic 39, pp. 139–150.
9. Stephen C. Kleene (1969): Formalized Recursive Functions and Formalized Realizability. Memoirs of the AMS 89. American Mathematical Society, Providence.
10. Daniel Leivant (1994): A foundational delineation of poly-time. Information and Computation 110, pp. 391–420.
11. Daniel Leivant (1995): Intrinsic theories and computational complexity. In: D. Leivant: Logic and Computational Complexity, LNCS. Springer-Verlag, Berlin, pp. 177–194.
12. Daniel Leivant (2002): Intrinsic reasoning about functional programs I: First order theories. Annals of Pure and Applied Logic 114, pp. 117–153, doi:10.1016/S0168-0072(01)00078-1.
13. Daniel Leivant (2004): Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. Theor. Comput. Sci. 318(1-2), pp. 181–196, doi:10.1016/j.tcs.2003.11.002.
14. Yiannis N. Moschovakis (1989): The Formal Language of Recursion. J. Symb. Log. 54(4), pp. 1216–1252, doi:10.2307/2274814.
15. Till Mossakowski, Lutz Schröder, Markus Roggenbach & Horst Reichel (2006): Algebraic-coalgebraic specification in CoCasl. J. Log. Algebr. Program. 67(1-2), pp. 146–197, doi:10.1016/j.jlap.2005.09.006. Available at http://dx.doi.org/10.1016/j.jlap.2005.09.006.
16. Peter D. Mosses (2004): CASL Reference Manual, The Complete Documentation of the Common Algebraic Specification Language. Lecture Notes in Computer Science 2960. Springer, doi:10.1007/b96103.
17. Peter Padawitz (2000): Swinging types=functions+relations+transition systems. Theor. Comput. Sci. 243(1-2), pp. 93–165, doi:10.1016/S0304-3975(00)00171-7.
18. Charles Parsons (1970): On a number-theoretic choice schema and its relation to induction. In: A. Kino, J. Myhill & R. Vesley: Intuitionism and Proof Theory. North-Holland, Amsterdam, pp. 459–473, doi:10.1016/S0049-237X(08)70771-7.
19. D. Prawitz (1965): Natural Deduction. Almqvist and Wiksell, Uppsala.
20. Horst Reichel (1999): A Uniform Model Theory for the Specification of Data and Process Types. In: Didier Bert, Christine Choppy & Peter D. Mosses: WADT, Lecture Notes in Computer Science 1827. Springer, pp. 348–365, doi:10.1007/978-3-540-44616-3_20.
21. Jan Rothe, Hendrik Tews & Bart Jacobs (2001): The Coalgebraic Class Specification Language CCSL. J. UCS 7(2), pp. 175–193. Available at http://www.jucs.org/jucs_7_2/the_coalgebraic_class_specification.
22. Lutz Schröder (2008): Bootstrapping Inductive and Coinductive Types in HasCASL. Logical Methods in Computer Science 4(4), doi:10.2168/LMCS-4(4:17)2008. Available at http://dx.doi.org/10.2168/LMCS-4(4:17)2008.
23. Ben A. Sijtsma (1989): On the Productivity of Recursive List Definitions. ACM Trans. Program. Lang. Syst. 11(4), pp. 633–649, doi:10.1145/69558.69563.
24. Alfred Tarski (1952): Some notions and methods on the borderline of algebra and metamathematics. In: Proceedings of the International Congress of Mathematicians I. American Mathematical Society, Providence, RI, pp. 705–720.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org