The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lawrence S. Moss: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuri Gurevich, Lawrence S. Moss
    Algebraic Operational Semantics and Occam. [Citation Graph (1, 0)][DBLP]
    CSL, 1989, pp:176-192 [Conf]
  2. David E. Johnson, Adam Meyers, Lawrence S. Moss
    A Unification-Based Parser for Relational Grammar. [Citation Graph (0, 0)][DBLP]
    ACL, 1993, pp:97-104 [Conf]
  3. Lawrence S. Moss, Satish R. Thatte
    Optimal semantics of data type extensions. [Citation Graph (0, 0)][DBLP]
    Algebraic Logic and Universal Algebra in Computer Science, 1988, pp:161-180 [Conf]
  4. Lawrence S. Moss
    Recursive Program Schemes: Past, Present, and Future. [Citation Graph (0, 0)][DBLP]
    AMAST, 2006, pp:2- [Conf]
  5. Lawrence S. Moss
    Uniform Functors on Sets. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:420-448 [Conf]
  6. Stefan Milius, Lawrence S. Moss
    The Category Theoretic Solution of Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    CALCO, 2005, pp:293-312 [Conf]
  7. Lawrence S. Moss, José Meseguer, Joseph A. Goguen
    Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1987, pp:158-181 [Conf]
  8. Michael W. Mislove, Lawrence S. Moss, Frank J. Oles
    Non-Well-Founded Sets Obtained from Ideal Fixed Points [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:263-272 [Conf]
  9. Lawrence S. Moss, Satish R. Thatte
    Generalization of Final Algebra Semantics by Relativization. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1989, pp:284-300 [Conf]
  10. Alexandru Batlag, Lawrence S. Moss, Slawomir Solecki
    The Logic of Public Announcements and Common Knowledge and Private Suspicions. [Citation Graph (0, 0)][DBLP]
    TARK, 1998, pp:43-56 [Conf]
  11. Lawrence S. Moss, Rohit Parikh
    Topological Reasoning and The Logic of Knowledge. [Citation Graph (0, 0)][DBLP]
    TARK, 1992, pp:95-105 [Conf]
  12. David E. Johnson, Lawrence S. Moss
    Some Formal Properties of Stratified Feature Grammars. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1993, v:8, n:1-2, pp:133-173 [Journal]
  13. Andrew Dabrowski, Lawrence S. Moss, Rohit Parikh
    Topological Reasoning and the Logic of Knowledge. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:73-110 [Journal]
  14. Lawrence S. Moss
    Power Set Recursion. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:71, n:3, pp:247-306 [Journal]
  15. Lawrence S. Moss
    Coalgebraic Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:277-317 [Journal]
  16. Andrew Dabrowski, Lawrence S. Moss
    The Johnson Graphs Satisfy a Distance Extension Property. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:295-300 [Journal]
  17. Lawrence S. Moss
    Simple Equational Specifications of Rational Arithmetic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:291-300 [Journal]
  18. Lawrence S. Moss
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:65, n:1, pp:- [Journal]
  19. Lawrence S. Moss
    Recursion and Corecursion Have the Same Equational Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:20, n:, pp:- [Journal]
  20. Lawrence S. Moss, Ignacio D. Viglizzo
    Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:106, n:, pp:279-295 [Journal]
  21. Michael W. Mislove, Lawrence S. Moss, Frank J. Oles
    Non-Well-Founded Sets Modeled as Ideal Fixed Points [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:1, pp:16-54 [Journal]
  22. Lawrence S. Moss, Ignacio D. Viglizzo
    Final coalgebras for functors on measurable spaces. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:4, pp:610-636 [Journal]
  23. Lawrence S. Moss, Norman Danner
    On the Foundations of Corecursion. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1997, v:5, n:2, pp:- [Journal]
  24. Lawrence S. Moss
    Exploring Logical Dynamics, Johan van Benthem. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2000, v:9, n:2, pp:261-263 [Journal]
  25. Lawrence S. Moss, David E. Johnson
    Dynamic Interpretations of Constraint-Based Grammar Formalisms. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1995, v:4, n:1, pp:61-79 [Journal]
  26. Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney
    The Logic of Recursive Equations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:451-478 [Journal]
  27. Lawrence S. Moss
    Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:3, pp:407-408 [Journal]
  28. Joseph S. Miller, Lawrence S. Moss
    The Undecidability of Iterated Modal Relativization. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2005, v:79, n:3, pp:373-407 [Journal]
  29. Stefan Milius, Lawrence S. Moss
    The category-theoretic solution of recursive program schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:1-2, pp:3-59 [Journal]
  30. Lawrence S. Moss
    Parametric corecursion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:260, n:1-2, pp:139-163 [Journal]
  31. Lawrence S. Moss
    Recursion and corecursion have the same equational logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:233-267 [Journal]
  32. Lawrence S. Moss, José Meseguer, Joseph A. Goguen
    Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:2, pp:267-302 [Journal]
  33. Lawrence S. Moss, Satish R. Thatte
    Modal Logic and Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:111, n:1&2, pp:191-210 [Journal]
  34. Lawrence S. Moss
    Distanced graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:3, pp:287-305 [Journal]

  35. Logics for Two Fragments beyond the Syllogistic Boundary. [Citation Graph (, )][DBLP]


  36. CIA Structures and the Semantics of Recursion. [Citation Graph (, )][DBLP]


  37. Intersecting Adjectives in Syllogistic Logic. [Citation Graph (, )][DBLP]


  38. Logics for the Relational Syllogistic [Citation Graph (, )][DBLP]


  39. The Category Theoretic Solution of Recursive Program Schemes [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.041secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002