| 2009 |
|---|
| 41 | EE | Stefan Milius,
Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes
CoRR abs/0904.2385: (2009) |
| 2008 |
|---|
| 40 | EE | Ian Pratt-Hartmann,
Lawrence S. Moss:
Logics for the Relational Syllogistic
CoRR abs/0808.0521: (2008) |
| 39 | EE | Lawrence S. Moss:
Confusion of memory.
Inf. Process. Lett. 107(3-4): 114-119 (2008) |
| 38 | EE | Stefan Milius,
Lawrence S. Moss:
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59].
Theor. Comput. Sci. 403(2-3): 409-415 (2008) |
| 2007 |
|---|
| 37 | EE | Rohit Parikh,
Lawrence S. Moss,
Chris Steinsvold:
Topology and Epistemic Logic.
Handbook of Spatial Logics 2007: 299-341 |
| 2006 |
|---|
| 36 | EE | Lawrence S. Moss:
Recursive Program Schemes: Past, Present, and Future.
AMAST 2006: 2 |
| 35 | EE | Lawrence S. Moss:
Uniform Functors on Sets.
Essays Dedicated to Joseph A. Goguen 2006: 420-448 |
| 34 | EE | Lawrence S. Moss,
Ignacio D. Viglizzo:
Final coalgebras for functors on measurable spaces.
Inf. Comput. 204(4): 610-636 (2006) |
| 33 | EE | Stefan Milius,
Lawrence S. Moss:
The category-theoretic solution of recursive program schemes.
Theor. Comput. Sci. 366(1-2): 3-59 (2006) |
| 2005 |
|---|
| 32 | EE | Stefan Milius,
Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes.
CALCO 2005: 293-312 |
| 31 | EE | Lawrence S. Moss:
Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science.
Mathematical Structures in Computer Science 15(3): 407-408 (2005) |
| 30 | EE | Lawrence S. Moss:
Joint review of "Introduction To Natural Computation by Dana H. Ballard"; MIT Press, 1997, ISBN 0-262-52258-6 and "Mathematical Methods in Artificial Intelligence by Edward A. Bender", IEEE Press, 1996 ISBN 0-8186-7200-5.
SIGACT News 36(1): 21-24 (2005) |
| 29 | EE | Joseph S. Miller,
Lawrence S. Moss:
The Undecidability of Iterated Modal Relativization.
Studia Logica 79(3): 373-407 (2005) |
| 2004 |
|---|
| 28 | EE | Lawrence S. Moss,
Ignacio D. Viglizzo:
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories.
Electr. Notes Theor. Comput. Sci. 106: 279-295 (2004) |
| 27 | EE | Lawrence S. Moss,
Hans-Jörg Tiede:
Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag.
SIGACT News 35(1): 8-12 (2004) |
| 2003 |
|---|
| 26 | | Lawrence S. Moss:
Recursion and corecursion have the same equational logic.
Theor. Comput. Sci. 294(1/2): 233-267 (2003) |
| 2002 |
|---|
| 25 | EE | Lawrence S. Moss:
Preface.
Electr. Notes Theor. Comput. Sci. 65(1): (2002) |
| 2001 |
|---|
| 24 | EE | Lawrence S. Moss:
Simple Equational Specifications of Rational Arithmetic.
Discrete Mathematics & Theoretical Computer Science 4(2): 291-300 (2001) |
| 23 | EE | Lawrence S. Moss:
Parametric corecursion.
Theor. Comput. Sci. 260(1-2): 139-163 (2001) |
| 2000 |
|---|
| 22 | EE | Andrew Dabrowski,
Lawrence S. Moss:
The Johnson Graphs Satisfy a Distance Extension Property.
Combinatorica 20(2): 295-300 (2000) |
| 21 | | Lawrence S. Moss:
Exploring Logical Dynamics, Johan van Benthem.
Journal of Logic, Language and Information 9(2): 261-263 (2000) |
| 1999 |
|---|
| 20 | | Lawrence S. Moss:
Coalgebraic Logic.
Ann. Pure Appl. Logic 96(1-3): 277-317 (1999) |
| 19 | EE | Lawrence S. Moss:
Recursion and Corecursion Have the Same Equational Logic.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 1998 |
|---|
| 18 | | Alexandru Batlag,
Lawrence S. Moss,
Slawomir Solecki:
The Logic of Public Announcements and Common Knowledge and Private Suspicions.
TARK 1998: 43-56 |
| 17 | | Antonius J. C. Hurkens,
Monica McArthur,
Yiannis N. Moschovakis,
Lawrence S. Moss,
Glen T. Whitney:
The Logic of Recursive Equations.
J. Symb. Log. 63(2): 451-478 (1998) |
| 1997 |
|---|
| 16 | EE | Lawrence S. Moss,
Norman Danner:
On the Foundations of Corecursion.
Logic Journal of the IGPL 5(2): (1997) |
| 1996 |
|---|
| 15 | | Andrew Dabrowski,
Lawrence S. Moss,
Rohit Parikh:
Topological Reasoning and the Logic of Knowledge.
Ann. Pure Appl. Logic 78(1-3): 73-110 (1996) |
| 1995 |
|---|
| 14 | | Lawrence S. Moss:
Power Set Recursion.
Ann. Pure Appl. Logic 71(3): 247-306 (1995) |
| 13 | | Lawrence S. Moss,
David E. Johnson:
Dynamic Interpretations of Constraint-Based Grammar Formalisms.
Journal of Logic, Language and Information 4(1): 61-79 (1995) |
| 1993 |
|---|
| 12 | | David E. Johnson,
Adam Meyers,
Lawrence S. Moss:
A Unification-Based Parser for Relational Grammar.
ACL 1993: 97-104 |
| 11 | | David E. Johnson,
Lawrence S. Moss:
Some Formal Properties of Stratified Feature Grammars.
Ann. Math. Artif. Intell. 8(1-2): 133-173 (1993) |
| 10 | | Lawrence S. Moss,
Satish R. Thatte:
Modal Logic and Algebraic Specifications.
Theor. Comput. Sci. 111(1&2): 191-210 (1993) |
| 1992 |
|---|
| 9 | | Lawrence S. Moss,
Rohit Parikh:
Topological Reasoning and The Logic of Knowledge.
TARK 1992: 95-105 |
| 8 | EE | Lawrence S. Moss:
Distanced graphs.
Discrete Mathematics 102(3): 287-305 (1992) |
| 7 | | Lawrence S. Moss,
José Meseguer,
Joseph A. Goguen:
Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability.
Theor. Comput. Sci. 100(2): 267-302 (1992) |
| 1991 |
|---|
| 6 | | Michael W. Mislove,
Lawrence S. Moss,
Frank J. Oles:
Non-Well-Founded Sets Modeled as Ideal Fixed Points
Inf. Comput. 93(1): 16-54 (1991) |
| 1989 |
|---|
| 5 | | Yuri Gurevich,
Lawrence S. Moss:
Algebraic Operational Semantics and Occam.
CSL 1989: 176-192 |
| 4 | | Michael W. Mislove,
Lawrence S. Moss,
Frank J. Oles:
Non-Well-Founded Sets Obtained from Ideal Fixed Points
LICS 1989: 263-272 |
| 3 | | Lawrence S. Moss,
Satish R. Thatte:
Generalization of Final Algebra Semantics by Relativization.
Mathematical Foundations of Programming Semantics 1989: 284-300 |
| 1988 |
|---|
| 2 | | Lawrence S. Moss,
Satish R. Thatte:
Optimal semantics of data type extensions.
Algebraic Logic and Universal Algebra in Computer Science 1988: 161-180 |
| 1987 |
|---|
| 1 | | Lawrence S. Moss,
José Meseguer,
Joseph A. Goguen:
Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability.
Category Theory and Computer Science 1987: 158-181 |
