Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ernie Manes

dblp:45/76 · also Ernest G. Manes · DBLP profile ↗
← Back
17ranked-venue papers
10as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 16 · 10 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Logic in computer science · 54% Automata and formal languages · 36% Algorithms and data structures · 11%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › abstract data types
parameterized data types
0.011982
Parametrized Data Types Do Not Need Highly Constrained Parameters · Inf. Control. 1982
Logic in computer science › logic programming › logic programming semantics
fixpoint semantics
0.011982
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions · J. ACM 1982
Automata and formal languages › transductions
tree transformations
0.011979
Intertwined Recursion, Tree Transformations, and Linear Systems · Inf. Control. 1979
Programming languages and type systems › control structures › recursion
recursive definitions
0.011982
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions · J. ACM 1982
Programming languages and type systems
type theory
0.011982
Parametrized Data Types Do Not Need Highly Constrained Parameters · Inf. Control. 1982
Algorithms and data structures › numerical linear algebra
linear system solving
0.011979
Intertwined Recursion, Tree Transformations, and Linear Systems · Inf. Control. 1979
YearPublicationVenuePosition
2020 Continuous Monads
abstract
Continuous monads are an axiomatic class of submonads of the double power set monad. ρ-sets are an axiomatic generalization of directed sets. The ρ-generalization of continuous lattices arises as the algebras of a continuous monad and conversely. Each ρ-continuous poset has two topologies which respectively generalize the Scott and Lawson topologies. Each ρ-contnuous lattice is compact in the canonical topology if and only if the corresponding continuous monad contains the ultrafilter monad.
Ernie Manes
MFPS1
2009 Boolean and classical restriction categories
abstract
A restriction category is an abstract category of partial maps. A Boolean restriction category is a restriction category that supports classical (Boolean) reasoning. Such categories are models of loop-free dynamic logic that is deterministic in the sense that < α > Q ⊂ [α]Q. Classical restriction categories are restriction categories with a locally Boolean structure: it is shown that they are precisely full subcategories of Boolean restriction categories. In particular, a Boolean restriction category may be characterised as a classical restriction category with finite coproducts in which all restriction idempotents split. Every restriction category admits a restriction embedding into a Boolean restriction category. Thus, every abstract category of partial maps admits a conservative extension that supports classical reasoning. An explicit construction of the classical completion of a restriction category is given.
J. Robin B. Cockett, Ernie Manes
Math. Struct. Comput. Sci.2
2008 Monad compositions II: Kleisli strength
abstract
In this paper we introduce the concept of Kleisli strength for monads in an arbitrary symmetric monoidal category. This generalises the notion of commutative monad and gives us new examples, even in the cartesian-closed category of sets. We exploit the presence of Kleisli strength to derive methods for generating distributive laws. We also introduce linear equations to extend the results to certain quotient monads. Mechanisms are described for finding strengths that produce a large collection of new distributive laws, and consequently monad compositions, including the composition of monadic data types such as lists, trees, exceptions and state.
Ernie Manes, Philip S. Mulry
Math. Struct. Comput. Sci.1
2006 Boolean restriction categories and taut monads
Ernie Manes
Theor. Comput. Sci.1
2002 Taut Monads and T0-spaces
Ernie Manes
Theor. Comput. Sci.1
1998 Implementing Collection Classes with Monads
Ernie Manes
Math. Struct. Comput. Sci.1
1993 The Equational Theory of a Boolean Monad
Ernie Manes
FCT1
1991 Equations for if-then-else
Ernie Manes
MFPS1
1990 A Transformational Characterization of if-then-else
Ernie Manes
Theor. Comput. Sci.1
1983 Port Automata and the Algebra of Concurrent Processes
Martha Steenstrup, Michael A. Arbib, Ernie Manes
J. Comput. Syst. Sci.3
1982 Parametrized Data Types Do Not Need Highly Constrained Parameters
Michael A. Arbib, Ernie Manes
Inf. Control.2
1982 The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
abstract
Umverslty of
Michael A. Arbib, Ernie Manes
J. ACM2
1980 Foundations of System Theory: The Hankel Matrix
Michael A. Arbib, Ernie Manes
J. Comput. Syst. Sci.2
1979 Partially-additive semantics: A progress report
Ernie Manes
FCT1
1979 Intertwined Recursion, Tree Transformations, and Linear Systems
Michael A. Arbib, Ernie Manes
Inf. Control.2
1977 Efficient State-Splitting
Michael A. Arbib, Ernie Manes
FCT2
1977 On the Point Transitivity of Symbolic Flows
Ernie Manes
Math. Syst. Theory1