Michael W. Mislove

Orcid: 0000-0002-6650-1399

Affiliations:
  • Tulane University, New Orleans, Department of Mathematics


According to our database1, Michael W. Mislove authored at least 80 papers between 1980 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Semantics for variational Quantum programming.
Proc. ACM Program. Lang., 2022

2021
LNL-FPC: The Linear/Non-linear Fixpoint Calculus.
Log. Methods Comput. Sci., 2021

The Central Valuations Monad.
CoRR, 2021

Commutative Monads for Probabilistic Programming Languages.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

The Central Valuations Monad (Early Ideas).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Domains and stochastic processes.
Theor. Comput. Sci., 2020

Quantum CPOs.
Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Completing Simple Valuations in K-categories.
CoRR, 2020

2019
Mixed linear and non-linear recursive types.
Proc. ACM Program. Lang., 2019

2018
Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Discrete Random Variables Over Domains, Revisited.
Proceedings of the Concurrency, Security, and Puzzles, 2017

2016
Semantics column.
ACM SIGLOG News, 2016

Semantics column.
ACM SIGLOG News, 2016

Domains and Random Variables.
CoRR, 2016

2015
From Haar to Lebesgue via Domain Theory, Revised version.
CoRR, 2015

2014
Anatomy of a domain of continuous random variables I.
Theor. Comput. Sci., 2014

From Haar to Lebesgue via Domain Theory.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Information Security as a Resource.
Inf. Comput., 2013

Preface.
Proceedings of the 6th International Symposium on Domain Theory and Its Applications, 2013

Preface.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Anatomy of a Domain of Continuous Random Variables II.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Dedication.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Preface.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Information Flow and Its Applications (Dagstuhl Seminar 12352).
Dagstuhl Reports, 2012

2011
Preface.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Probabilistic Monads, Domains and Classical Information
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

2010
Preface.
Theor. Comput. Sci., 2010

Preface.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

Reasoning about Probabilistic Security Using Task-PIOAs.
Proceedings of the Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, 2010

10232 Report - The Semantics of Information.
Proceedings of the Semantics of Information, 06.06. - 11.06.2010, 2010

2009
Preface.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

2008
Preface.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

2007
Discrete random variables over domains.
Theor. Comput. Sci., 2007

Continuous Lattices and Domains.
Stud Logica, 2007

Labelled Markov Processes as Generalised Stochastic Relations.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Monoids over domains.
Math. Struct. Comput. Sci., 2006

Editor's Note.
Proceedings of the Combined Proceedings of the Fourth Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR 2006) and the First International Workshop on Probabilistic Automata and Logics (PaUL 2006), 2006

Testing Semantics: Connecting Processes and Process Logics.
Proceedings of the Algebraic Methodology and Software Technology, 2006

2005
Domain theory, testing and simulation for labelled Markov processes.
Theor. Comput. Sci., 2005

On Combining Probability and Nondeterminism.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Preface.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

2004
Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16.
Theor. Comput. Sci., 2004

Measuring the probabilistic powerdomain.
Theor. Comput. Sci., 2004

A simple process algebra based on atomic actions with resources.
Math. Struct. Comput. Sci., 2004

Duality for Labelled Markov Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Axioms for Probability and Nondeterminism.
Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Editorial.
Proceedings of the Combined Proceedings of the Second Workshop on Categorical Methods for Concurrency, 2003

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
A truly concurrent semantics for a process algebra using resource pomsets.
Theor. Comput. Sci., 2002

Dedication.
Theor. Comput. Sci., 2002

Foreword - MFPS 1996.
Theor. Comput. Sci., 2002

2001
25 Years.
Theor. Comput. Sci., 2001

Preface.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

2000
Modern Algebra - Foreword.
Theor. Comput. Sci., 2000

Semantic models for concurrency.
ACM SIGSOFT Softw. Eng. Notes, 2000

Models Supporting Nondeterminism and Probabilistic Choice.
Proceedings of the Parallel and Distributed Processing, 2000

Nondeterminism and Probabilistic Choice: Obeying the Laws.
Proceedings of the CONCUR 2000, 2000

1999
Local Dcpos, Local Cpos and Local Completions.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Preface.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Trace Theory and State Explosion.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

A Truly Concurrent Semantics for a Simple Parallel Programming Language.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
Generalizing Domain Theory.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
Using duality to solve domain equations.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Preface.
Proceedings of the US-Brazil Joint Workshops on the Formal Foundations of Software Systems, 1997

Foreword.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

1995
Fixed Points Without Completeness.
Theor. Comput. Sci., 1995

Full Abstraction and Recursion.
Theor. Comput. Sci., 1995

Adjunctions Between Categories of Domains.
Fundam. Informaticae, 1995

All Compact Hausdorff Lambda Models are Degenerate.
Fundam. Informaticae, 1995

Denotational models for unbounded nondeterminism.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Foreword and Dedication.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1992
Full Abstraction and Unnested Recursion.
Proceedings of the Sematics: Foundations and Applications, 1992

1991
Non-Well-Founded Sets Modeled as Ideal Fixed Points
Inf. Comput., July, 1991

A Simple Language Supporting Angelic Nondeterminism and Parallel Composition.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1989
Non-Well-Founded Sets Obtained from Ideal Fixed Points
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1987
Ordered sets with no infinite antichains.
Discret. Math., 1987

On the Smyth Power Domain.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1985
Detecting Local Finite Breadth in Continuous Lattices and Semilattices.
Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1980
A compendium of continous lattices.
Springer, ISBN: 978-3-540-10111-6, 1980


  Loading...