Dominic P. Mulligan

According to our database1, Dominic P. Mulligan authored at least 21 papers between 2008 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Interleaving anomalies in collaborative text editors.
Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data, 2019

2018
OpSets: Sequential Specifications for Replicated Datatypes (Extended Version).
CoRR, 2018

OpSets: Sequential Specifications for Replicated Datatypes.
Arch. Formal Proofs, 2018

2017
Verifying strong eventual consistency in distributed systems.
Proc. ACM Program. Lang., 2017

The LambdaMu-calculus.
Arch. Formal Proofs, 2017

A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes.
Arch. Formal Proofs, 2017

Programming and Proving with Classical Types.
Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

2016
The missing link: explaining ELF static linking, semantically.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016

2015
An integrated concurrency and core-ISA architectural envelope definition, and test oracle, for IBM POWER multiprocessors.
Proceedings of the 48th International Symposium on Microarchitecture, 2015

2014
Lem: reusable engineering of real-world semantics.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013

2012
Corrigendum to "Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms" [Inf.Comput.208(3)(2010) 230-258].
Inf. Comput., 2012

On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
Extensions of nominal terms.
PhD thesis, 2011

Certified Complexity.
Proceedings of the 2nd European Future Technologies Conference and Exhibition, 2011

Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
Proceedings of the Proceedings Sixth International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2011

2010
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques.
Log. J. IGPL, 2010

Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms.
Inf. Comput., 2010

2009
Two-level Lambda-calculus.
Electron. Notes Theor. Comput. Sci., 2009

Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables.
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009

2008
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations.
Proceedings of the Logic, 2008


  Loading...