Остановите войну!
for scientists:
default search action
Lawrence S. Moss
- > Home > Persons > Lawrence S. Moss
Publications
- 2023
- [c52]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). CALCO 2023: 21:1-21:20 - [i17]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors. CoRR abs/2303.11071 (2023) - 2021
- [c47]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Initial Algebras Without Iteration ((Co)algebraic pearls). CALCO 2021: 5:1-5:20 - [i12]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
An Initial Algebra Theorem Without Iteration. CoRR abs/2104.09837 (2021) - 2020
- [c42]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. FoSSaCS 2020: 17-36 - 2019
- [i7]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. CoRR abs/1910.09401 (2019) - 2018
- [j45]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Fixed points of functors. J. Log. Algebraic Methods Program. 95: 41-81 (2018) - 2015
- [j43]Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. 23(4): 609-641 (2015) - [j42]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat:
On finitary functors and their presentations. J. Comput. Syst. Sci. 81(5): 813-833 (2015) - 2013
- [j41]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. Log. Methods Comput. Sci. 9(3) (2013) - [j40]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras. Log. Methods Comput. Sci. 9(3) (2013) - 2012
- [c25]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Finitary Functors and Their Presentations. CMCS 2012: 51-70 - [c24]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 - 2011
- [c22]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Power-Set Functors and Saturated Trees. CSL 2011: 5-19 - 2010
- [c19]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
CIA Structures and the Semantics of Recursion. FoSSaCS 2010: 312-327 - 2009
- [i2]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CoRR abs/0904.2385 (2009) - 2008
- [j31]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) - 2006
- [j27]Stefan Milius, Lawrence S. Moss:
The category-theoretic solution of recursive program schemes. Theor. Comput. Sci. 366(1-2): 3-59 (2006) - 2005
- [c14]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CALCO 2005: 293-312
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-03 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint