Coinductive models of finite computing agents

Electronic Notes in Theoretical Computer Science

Volumn 19, Issue , 1999, Pages 81-101

  Wegner, Peter ^a   Goldin, Dina ^b  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; FUNCTIONS; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS); TURING MACHINES;

COINDUCTIVE METHODS; MATHEMATICAL EXTENSIONS; SOFTWARE SYSTEMS; SOFTWARE TECHNOLOGY;

ALGEBRA;

EID: 0003369301     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80270-1     Document Type: Conference Paper

References (29)

1. Samson Abramsky. Semantics of Interaction. Semantics and Logic of Computation, ed. A. Pitts and P. Dibyer, Cambridge, 1997.
2. Peter Aczel. Non Well-Founded Sets. CSLI Lecture Notes #14, Stanford, 1988.
3. Agre Phil. Computational Research on Interaction and Agency. Artificial Intelligence. January 1995
4. Barwise Jon, Moss Lawrence. Vicious Circles. 1996;CSLI Lecture Notes #60
5. Cardelli Luca, Wegner Peter. On Understanding Types, Data Abstraction, and Polymorphism. Computing Surveys. December 1985
6. Detlefsen Michael. Philosophy of Mathematics in the Twentieth Century. Shanker S. Philosophy of Science, Logic, and Mathematics in the Twentieth Century. 1996;Routledge
7. Dijkstra Edsger. The Discipline of Programming. 1976;Prentice-Hall
8. Thomas Dean and Michael Wellman. Planning and Control, Morgan Kaufman 1991.
9. Encyclopaedia Britannica, Article on Realism.
10. Solomon Feferman. Kurt Godel, Conviction and Caution. In Godel's Theorem in Focus, Ed Shanker, Methuen, 1988.
11. Paul Finsler. Finsler Set Theory: Platonism and Circularity, Eds. David Booth and Renatus Ziegler, Birkhauser, 1996.
12. Gamma Erich, Helm Richard, Johnson Ralph, Vlissides John. Design Patterns: Elements of Reusable Object-Oriented Software. 1994;Addison-Wesley
13. Jean-Yves Girard. Linear Logic. Theoretical Computer Science. 50:1987
14. Dina Goldin and Peter Wegner. Persistent Turing Machines, Brown Technical Report, 1998.
15. Jacobs Bart, Rutten Jan. A Tutorial on Coalgebras and Coinduction. EATCS Bulletin 62. 1997
16. Kripke Saul. A Completeness Theorem in Modal Logic. Journal of Symbolic Logic. 1959
17. Milner Robin. Operational and Algebraic Semantics of Concurrent Processes. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;Elsevier
18. Popper Karl. The Logic of Scientific Discovery. Harper. 1965
19. Pratt Vaughan. Chu Spaces and Their Interpretation as Concurrent Objects. van Leeuwen Ed.Jan. Computer Science Today: Recent Trends and Developments. LNCS. #1000:1995
20. Russell Stuart, Norvig Peter. Artificial Intelligence: A Modern Approach. 1994;Addison-Wesley
21. Scott Dana. The Lattice Flow Diagrams. Lecture Notes in Mathematics, Springer. 1971
22. Alan Turing. On Computable Numbers with an Application to the Entscheidungsproblem. Proc. London Math Society, 2:42, pp. 230-265, 1936.
23. Turing Alan. Computing Machinery and Intelligence. Mind. 1950
24. Wegner Peter. Why Interaction is More Powerful Than Algorithms. Communications of the ACM. May 1997
25. Wegner Peter. Interactive Foundations of Computing. Theoretical Computer Science. Feb. 1998
26. Peter Wegner. Towards Empirical Computer Science. The Monist, Issue on the Philosophy of Computation, Jan. 1999, available at www.cs.brown.edu/people/ pw.
27. Peter Wegner. Interactive Software Technology. Handbook of Computer Science and Engineering, Ed. A. Tucker, CRC Press, 1996.
28. Wegner Peter. Tradeoffs Between Reasoning and Modeling. Wegner Agha. Research Directions in Concurrent Object-Oriented Programming. 1993;Yonezawa, MIT Press
29. Peter Wegner and Dina Goldin. Mathematical Models of Interactive Computing. Brown Technical Report, www.cs.brown.edu/people/pw.