| Publication | Date of Publication | Type |
|---|
Joint distributions in probabilistic semantics
| 2026-04-02 | Paper |
Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity
| 2024-11-14 | Paper |
Minimisation in logical form
| 2024-10-01 | Paper |
Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
Programming Languages and Systems | 2023-08-03 | Paper |
Rational spaces and set constraints
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
The Ackermann Award 2018
| 2022-05-28 | Paper |
Coalgebraic tools for randomness-conserving protocols
Journal of Logical and Algebraic Methods in Programming | 2022-03-09 | Paper |
Formalizing Moessner's theorem and generalizations in \textsc{Nuprl}
Journal of Logical and Algebraic Methods in Programming | 2021-11-24 | Paper |
Infinitary axiomatization of the equational theory of context-free languages
| 2021-06-10 | Paper |
Semantics of Probabilistic Programming: A Gentle Introduction
Foundations of Probabilistic Programming | 2021-02-16 | Paper |
On the coalgebraic theory of Kleene algebra with tests
Outstanding Contributions to Logic | 2020-07-27 | Paper |
Left-handed completeness
Theoretical Computer Science | 2020-01-22 | Paper |
scientific article; zbMATH DE number 7136663 (Why is no real title available?)
| 2019-11-26 | Paper |
Optimal bounds for the change-making problem
Automata, Languages and Programming | 2019-03-29 | Paper |
Natural transformations as rewrite rules and monad composition
| 2019-01-18 | Paper |
Coalgebraic tools for randomness-conserving protocols
Relational and Algebraic Methods in Computer Science | 2018-11-08 | Paper |
Coalgebraic Tools for Randomness-Conserving Protocols
| 2018-07-07 | Paper |
KAT + B!
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Kolmogorov extension, martingale convergence, and compositionality of processes
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
CoCaml: functional programming with regular coinductive types
Fundamenta Informaticae | 2017-11-10 | Paper |
Infinitary axiomatization of the equational theory of context-free languages
Fundamenta Informaticae | 2017-11-10 | Paper |
Cantor meets Scott: semantic foundations for probabilistic networks
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Well-founded coalgebras, revisited
Mathematical Structures in Computer Science | 2017-09-27 | Paper |
Practical coinduction
Mathematical Structures in Computer Science | 2017-09-27 | Paper |
Completeness and incompleteness in nominal Kleene algebra
Journal of Logical and Algebraic Methods in Programming | 2017-08-31 | Paper |
Stone duality for Markov processes
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Substructural logic and partial correctness
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
A note on the complexity of propositional Hoare logic
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Nominal automata with name binding
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Capsules and separation
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Kleene algebra with products and iteration theories
| 2017-02-02 | Paper |
Reflection in the Chomsky hierarchy
| 2016-12-16 | Paper |
A coalgebraic decision procedure for NetKAT
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Realization of coinductive types
Electronic Notes in Theoretical Computer Science | 2016-07-15 | Paper |
New
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
A metrized duality theorem for Markov processes
| 2016-05-13 | Paper |
Probabilistic NetKAT
Programming Languages and Systems | 2016-04-26 | Paper |
NetKAT -- a formal system for the verification of networks
Programming Languages and Systems | 2016-02-26 | Paper |
Completeness and incompleteness in nominal Kleene algebra
Relational and Algebraic Methods in Computer Science | 2016-01-08 | Paper |
Nominal Kleene coalgebra
Automata, Languages, and Programming | 2015-11-04 | Paper |
Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management*
Games, Norms and Reasons | 2015-07-03 | Paper |
Computing with capsules
| 2015-03-16 | Paper |
Kleene algebra with equations
Automata, Languages, and Programming | 2014-07-01 | Paper |
Optimal coin flipping
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Indexing of subrecursive classes
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Strong completeness for Markovian logics
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Language constructs for non-well-founded computation
Programming Languages and Systems | 2013-08-05 | Paper |
On Moessner's theorem
The American Mathematical Monthly | 2013-05-28 | Paper |
Computing with capsules
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Left-handed completeness
Relational and Algebraic Methods in Computer Science | 2012-09-21 | Paper |
Church–Rosser Made Easy
Fundamenta Informaticae | 2011-05-18 | Paper |
Halting and equivalence of program schemes in models of arbitrary theories
Fields of Logic and Computation | 2010-09-03 | Paper |
Applications of metric coinduction
Logical Methods in Computer Science | 2010-01-28 | Paper |
KAT-ML: an interactive theorem prover for Kleene algebra with tests
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
Relational Semantics for Higher-Order Programs
Lecture Notes in Computer Science | 2009-04-02 | Paper |
Automating Proofs in Category Theory
Automated Reasoning | 2009-03-12 | Paper |
Applications of metric coinduction
Lecture Notes in Computer Science | 2009-03-10 | Paper |
The Böhm–Jacopini Theorem Is False, Propositionally
Lecture Notes in Computer Science | 2008-08-28 | Paper |
Local variable scoping and Kleene algebra with tests
The Journal of Logic and Algebraic Programming | 2008-06-19 | Paper |
Local Variable Scoping and Kleene Algebra with Tests
Relations and Kleene Algebra in Computer Science | 2008-04-24 | Paper |
Coinductive Proof Principles for Stochastic Processes
Logical Methods in Computer Science | 2008-04-01 | Paper |
On the Representation of Kleene Algebras with Tests
Lecture Notes in Computer Science | 2007-09-05 | Paper |
On the complexity of reasoning in Kleene algebra
Information and Computation | 2006-10-10 | Paper |
Theory of computation.
Texts in Computer Science | 2006-05-31 | Paper |
scientific article; zbMATH DE number 2208070 (Why is no real title available?)
| 2005-09-26 | Paper |
Some results in dynamic model theory
Science of Computer Programming | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2102743 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2090017 (Why is no real title available?)
| 2004-08-12 | Paper |
Computational inductive definability
Annals of Pure and Applied Logic | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2077105 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2012392 (Why is no real title available?)
| 2003-12-15 | Paper |
scientific article; zbMATH DE number 1984270 (Why is no real title available?)
| 2003-09-22 | Paper |
scientific article; zbMATH DE number 1852915 (Why is no real title available?)
| 2003-01-29 | Paper |
Tarskian set constraints
Information and Computation | 2003-01-14 | Paper |
On the completeness of propositional Hoare logic
Information Sciences | 2002-06-23 | Paper |
scientific article; zbMATH DE number 1696821 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1256673 (Why is no real title available?)
| 2002-01-20 | Paper |
scientific article; zbMATH DE number 1688351 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 799767 (Why is no real title available?)
| 2001-09-05 | Paper |
scientific article; zbMATH DE number 1556014 (Why is no real title available?)
| 2001-01-24 | Paper |
scientific article; zbMATH DE number 1555173 (Why is no real title available?)
| 2001-01-22 | Paper |
scientific article; zbMATH DE number 1555185 (Why is no real title available?)
| 2001-01-22 | Paper |
scientific article; zbMATH DE number 1332657 (Why is no real title available?)
| 1999-09-07 | Paper |
Set constraints and logic programming
Information and Computation | 1999-08-08 | Paper |
scientific article; zbMATH DE number 1142324 (Why is no real title available?)
| 1998-05-14 | Paper |
Computing the Newtonian graph
Journal of Symbolic Computation | 1998-04-20 | Paper |
scientific article; zbMATH DE number 1086671 (Why is no real title available?)
| 1997-11-13 | Paper |
Decomposition of algebraic functions
Journal of Symbolic Computation | 1997-09-11 | Paper |
scientific article; zbMATH DE number 1033559 (Why is no real title available?)
| 1997-07-14 | Paper |
Rational spaces and set constraints
Theoretical Computer Science | 1997-02-27 | Paper |
Decidability of systems of set constraints with negative constraints
Information and Computation | 1995-10-30 | Paper |
Efficient recursive subtyping
Mathematical Structures in Computer Science | 1995-10-25 | Paper |
scientific article; zbMATH DE number 749931 (Why is no real title available?)
| 1995-05-01 | Paper |
Efficient inference of partial types
Journal of Computer and System Sciences | 1994-11-06 | Paper |
A completeness theorem for Kleene algebras and the algebra of regular events
Information and Computation | 1994-06-19 | Paper |
Optimal bounds for the change-making problem
Theoretical Computer Science | 1994-02-22 | Paper |
scientific article; zbMATH DE number 58315 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 51893 (Why is no real title available?)
| 1992-09-18 | Paper |
scientific article; zbMATH DE number 4210141 (Why is no real title available?)
| 1990-01-01 | Paper |
Definability with bounded number of bound variables
Information and Computation | 1989-01-01 | Paper |
A finite model theorem for the propositional \(\mu\)-calculus
Studia Logica | 1989-01-01 | Paper |
Polynomial decomposition algorithms
Journal of Symbolic Computation | 1989-01-01 | Paper |
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
SIAM Journal on Computing | 1988-01-01 | Paper |
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4005454 (Why is no real title available?)
| 1986-01-01 | Paper |
A probabilistic PDL
Journal of Computer and System Sciences | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3965452 (Why is no real title available?)
| 1985-01-01 | Paper |
A zero-one law for logic with a fixed-point operator
Information and Control | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3898850 (Why is no real title available?)
| 1984-01-01 | Paper |
A programming language for the inductive sets, and applications
Information and Control | 1984-01-01 | Paper |
Results on the propositional \(\mu\)-calculus
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3799616 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3779293 (Why is no real title available?)
| 1982-01-01 | Paper |
Process logic: Expressiveness, decidability, completeness
Journal of Computer and System Sciences | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3791600 (Why is no real title available?)
| 1982-01-01 | Paper |
Alternation
Journal of the ACM | 1981-01-01 | Paper |
Semantics of probabilistic programs
Journal of Computer and System Sciences | 1981-01-01 | Paper |
An elementary proof of the completeness of PDL
Theoretical Computer Science | 1981-01-01 | Paper |
Positive First-Order Logic Is NP-Complete
IBM Journal of Research and Development | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3756452 (Why is no real title available?)
| 1981-01-01 | Paper |
Complexity of Boolean algebras
Theoretical Computer Science | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3704559 (Why is no real title available?)
| 1980-01-01 | Paper |
Indexings of subrecursive classes
Theoretical Computer Science | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3696506 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3614188 (Why is no real title available?)
| 1978-01-01 | Paper |
