James Chapman

Orcid: 0000-0001-9036-8252

Affiliations:
  • Institute of Cybernetics, Tallinn, Estonia
  • IOHK, Hong Kong
  • University of Strathclyde, UK


According to our database1, James Chapman authored at least 22 papers between 2005 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Algebraic Reasoning About Timeliness.
Proceedings of the Proceedings 16th Interaction and Concurrency Experience, 2023

2022
Mind Your Outcomes: The ΔQSD Paradigm for Quality-Centric Systems Development and Its Application to a Blockchain Case Study.
Comput., 2022

Reasonable Agda is correct Haskell: writing verified Haskell using agda2hs.
Proceedings of the Haskell '22: 15th ACM SIGPLAN International Haskell Symposium, Ljubljana, Slovenia, September 15, 2022

2020
Flexible Formality Practical Experience with Agile Formal Methods.
Proceedings of the Trends in Functional Programming - 21st International Symposium, 2020

UTXO<sub>sf ma</sub>: UTXO with Multi-asset Support.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Applications, 2020

Native Custom Tokens in the Extended UTXO Model.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Applications, 2020

The Extended UTXO Model.
Proceedings of the Financial Cryptography and Data Security, 2020

2019
Quotienting the delay monad by weak bisimilarity.
Math. Struct. Comput. Sci., 2019

System F in Agda, for Fun and Profit.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

2018
A type and scope safe universe of syntaxes with binding: their semantics and proofs.
Proc. ACM Program. Lang., 2018

2017
Formalizing Restriction Categories.
J. Formaliz. Reason., 2017

Type-and-scope safe programs and their proofs.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2015
Monads need not be endofunctors.
Log. Methods Comput. Sci., 2015

2014
Relative Monads Formalised.
J. Formaliz. Reason., 2014

When is a container a comonad?
Log. Methods Comput. Sci., 2014

Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types.
Proceedings of the Proceedings 5th Workshop on Mathematically Structured Functional Programming, 2014

2010
The gentle art of levitation.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

2009
Type checking and normalisation.
PhD thesis, 2009

Big-step normalisation.
J. Funct. Program., 2009

2008
Type Theory Should Eat Itself.
Proceedings of the International Workshop on Logical Frameworks and Metalanguages: Theory and Practice, 2008

2006
Tait in One Big Step.
Proceedings of the Workshop on Mathematically Structured Functional Programming, 2006

2005
Epigram reloaded: a standalone typechecker for ETT.
Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005


  Loading...