default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnie Manes
Person information
- affiliation: University of Massachusetts, Amherst, MA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c18]Ernie Manes:
Continuous Monads. MFPS 2020: 173-190
2010 – 2019
- 2018
- [c17]Ernie Manes, Philip S. Mulry:
Near Distributive Laws. MFPS 2018: 277-295
2000 – 2009
- 2009
- [j15]J. Robin B. Cockett, Ernie Manes:
Boolean and classical restriction categories. Math. Struct. Comput. Sci. 19(2): 357-416 (2009) - 2008
- [j14]Ernie Manes, Philip S. Mulry:
Monad compositions II: Kleisli strength. Math. Struct. Comput. Sci. 18(3): 613-643 (2008) - 2007
- [c16]Ernie Manes:
Taut Monads, Dynamic Logic and Determinism. MFPS 2007: 241-262 - 2006
- [j13]Ernie Manes:
Boolean restriction categories and taut monads. Theor. Comput. Sci. 360(1-3): 77-95 (2006) - 2002
- [j12]Ernest G. Manes:
Taut Monads and T0-spaces. Theor. Comput. Sci. 275(1-2): 79-109 (2002) - 2001
- [j11]Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes:
Iteration 2-theories. Appl. Categorical Struct. 9(2): 173-216 (2001)
1990 – 1999
- 1998
- [j10]Ernest G. Manes:
Implementing Collection Classes with Monads. Math. Struct. Comput. Sci. 8(3): 231-276 (1998) - 1997
- [c15]Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes:
Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44 - 1993
- [c14]Ernest G. Manes:
The Equational Theory of a Boolean Monad. FCT 1993: 363-374 - 1992
- [b2]Ernest G. Manes:
Predicate transformer semantics. Cambridge tracts in theoretical computer science 33, Cambridge University Press 1992, ISBN 978-0-521-42036-5, pp. 1-223 - 1991
- [c13]Ernest G. Manes:
Equations for if-then-else. MFPS 1991: 446-456 - 1990
- [j9]Ernest G. Manes:
A Transformational Characterization of if-then-else. Theor. Comput. Sci. 71(3): 413-417 (1990)
1980 – 1989
- 1988
- [c12]Ernest G. Manes:
Monads, Matrices and Generalized Dynamic Algebra. Categorial Methods in Computer Science 1988: 66-81 - 1987
- [c11]Ernie Manes:
Assertional Categories. MFPS 1987: 85-120 - 1986
- [b1]Ernest G. Manes, Michael A. Arbib:
Algebraic Approaches to Program Ssemantics. Texts and Monographs in Computer Science, Springer 1986, ISBN 978-0-387-96324-2, pp. I-XIII, 1-351 - 1985
- [c10]Ernest G. Manes:
Weakest Preconditions: Categorical Insights. CTCS 1985: 182-197 - [c9]Ernest G. Manes:
Additive Domains. Mathematical Foundations of Programming Semantics 1985: 184-195 - 1983
- [j8]Martha Steenstrup, Michael A. Arbib, Ernest G. Manes:
Port Automata and the Algebra of Concurrent Processes. J. Comput. Syst. Sci. 27(1): 29-50 (1983) - 1982
- [j7]Michael A. Arbib, Ernest G. Manes:
Parametrized Data Types Do Not Need Highly Constrained Parameters. Inf. Control. 52(2): 139-158 (1982) - [j6]Michael A. Arbib, Ernest G. Manes:
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions. J. ACM 29(2): 577-602 (1982) - 1980
- [j5]Michael A. Arbib, Ernest G. Manes:
Foundations of System Theory: The Hankel Matrix. J. Comput. Syst. Sci. 20(3): 330-378 (1980)
1970 – 1979
- 1979
- [j4]Michael A. Arbib, Ernest G. Manes:
Intertwined Recursion, Tree Transformations, and Linear Systems. Inf. Control. 40(2): 144-180 (1979) - [c8]Ernest G. Manes:
Partially-additive semantics: A progress report. FCT 1979: 279-290 - 1978
- [j3]Michael A. Arbib, Ernest G. Manes:
Tree transformations and the semantics of loop-free programs. Acta Cybern. 4(1): 11-17 (1978) - [c7]Michael A. Arbib, Ernest G. Manes:
Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls. Graph-Grammars and Their Application to Computer Science and Biology 1978: 127-138 - 1977
- [j2]Ernest G. Manes:
On the Point Transitivity of Symbolic Flows. Math. Syst. Theory 10: 259-261 (1977) - [c6]Michael A. Arbib, Ernest G. Manes:
Efficient State-Splitting. FCT 1977: 228-239 - 1975
- [e1]Ernest G. Manes:
Category Theory Applied to Computation and Control, Proceedings of the First International Symposium, San Francisco, CA, USA, February 25-26, 1974, Proceedings. Lecture Notes in Computer Science 25, Springer 1975, ISBN 3-540-07142-3 [contents] - 1974
- [j1]Michael A. Arbib, Ernest G. Manes:
Foundations of system theory: Decomposable systems. Autom. 10(3): 285-302 (1974) - [c5]Michael A. Arbib, Ernest G. Manes:
Basic concepts of category theory applicable to computation and control. Category Theory Applied to Computation and Control 1974: 1-34 - [c4]Michael A. Arbib, Ernest G. Manes:
A categorist's view of automata and systems. Category Theory Applied to Computation and Control 1974: 51-64 - [c3]Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes:
Realization of multilinear and multidcomposable machines. Category Theory Applied to Computation and Control 1974: 73-79 - [c2]Michael A. Arbib, Ernest G. Manes:
Fuzzy morphism in automata theory. Category Theory Applied to Computation and Control 1974: 80-86 - [c1]Michael A. Arbib, Ernest G. Manes:
Time-varying systems. Category Theory Applied to Computation and Control 1974: 87-92
Coauthor Index
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
