default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominic A. Orchard
Person information
- affiliation: University of Kent
- affiliation (former): University of Cambridge
- affiliation (former): Imperial College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Dominic A. Orchard:
Programming contextual computations. University of Cambridge, UK, 2014
Journal Articles
- 2024
- [j11]Danielle Marshall, Dominic Orchard
:
Functional Ownership through Fractional Uniqueness. Proc. ACM Program. Lang. 8(OOPSLA1): 1040-1070 (2024) - 2023
- [j10]Laura Bocchi, Dominic Orchard, A. Laura Voinea:
A Theory of Composing Protocols. Art Sci. Eng. Program. 7(2) (2023) - 2022
- [j9]Danielle Marshall, Dominic Orchard:
How to Take the Inverse of a Type (Artifact). Dagstuhl Artifacts Ser. 8(2): 01:1-01:3 (2022) - 2019
- [j8]Dominic Orchard, Vilem-Benjamin Liepelt, Harley Eades III:
Quantitative program reasoning with graded modal types. Proc. ACM Program. Lang. 3(ICFP): 110:1-110:30 (2019) - 2018
- [j7]Dominic A. Orchard:
Complexity bounds for container functors and comonads. Inf. Comput. 261: 144-158 (2018) - 2017
- [j6]Dominic A. Orchard, Nobuko Yoshida:
Guest editors' foreword. J. Log. Algebraic Methods Program. 90: 1 (2017) - [j5]Dominic A. Orchard, Mistral Contrastin, Matthew Danish, Andrew C. Rice:
Verifying spatial properties of array computations. Proc. ACM Program. Lang. 1(OOPSLA): 75:1-75:30 (2017) - 2016
- [j4]Mistral Contrastin, Andrew C. Rice, Matthew Danish, Dominic A. Orchard:
Units-of-Measure Correctness in Fortran Programs. Comput. Sci. Eng. 18(1): 102-107 (2016) - 2015
- [j3]Dominic A. Orchard, Andrew C. Rice, Oleg Oshmyan:
Evolving Fortran types with inferred units-of-measure. J. Comput. Sci. 9: 156-162 (2015) - 2014
- [j2]Dominic A. Orchard:
Computational Semantics with Functional Programming, byJan van Eijck andChristina Unger. J. Funct. Program. 24(4): 524-527 (2014) - 2008
- [j1]Dominic A. Orchard, Steve Matthews:
Integrating Lucid's Declarative Dataflow Paradigm into Object-Orientation. Math. Comput. Sci. 2(1): 103-122 (2008)
Conference and Workshop Papers
- 2024
- [c31]Jack Hughes, Dominic Orchard:
Program Synthesis from Graded Types. ESOP (1) 2024: 83-112 - 2023
- [c30]Dominic Orchard, Mihail Munteanu, Paulo Torrens:
Communicating Actor Automata - Modelling Erlang Processes as Communicating Machines. PLACES@ETAPS 2023: 38-48 - 2022
- [c29]Danielle Marshall, Dominic Orchard:
How to Take the Inverse of a Type. ECOOP 2022: 5:1-5:27 - [c28]Danielle Marshall, Michael Vollmer, Dominic Orchard:
Linearity and Uniqueness: An Entente Cordiale. ESOP 2022: 346-375 - [c27]Danielle Marshall, Dominic Orchard:
Replicate, Reuse, Repeat: Capturing Non-Linear Communication via Session Types and Graded Modal Types. PLACES@ETAPS 2022: 1-11 - 2021
- [c26]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. ESOP 2021: 234-263 - [c25]Benjamin Moon, Harley Eades III, Dominic Orchard:
Graded Modal Dependent Type Theory. ESOP 2021: 462-490 - 2020
- [c24]Andrej Ivaskovic, Alan Mycroft, Dominic Orchard:
Data-Flow Analyses as Effects and Graded Monads. FSCD 2020: 15:1-15:23 - [c23]Jack Hughes, Dominic Orchard:
Resourceful Program Synthesis from Graded Linear Types. LOPSTR 2020: 151-170 - [c22]Dominic Orchard, Philip Wadler, Harley Eades III:
Unifying graded and parameterised monads. MSFP@ETAPS 2020: 18-38 - [c21]Jack Hughes, Michael Vollmer, Dominic Orchard:
Deriving Distributive Laws for Graded Linear Types. Linearity&TLLA@IJCAR-FSCD 2020: 109-131 - 2019
- [c20]Li-yao Xia, Dominic Orchard, Meng Wang:
Composing Bidirectional Programs Monadically. ESOP 2019: 147-175 - [c19]Matthew Danish, Miltiadis Allamanis, Marc Brockschmidt, Andrew C. Rice, Dominic Orchard:
Learning units-of-measure from scientific code. SE4Science@ICSE 2019: 43-46 - 2018
- [c18]Mistral Contrastin, Dominic A. Orchard, Andrew C. Rice:
Automatic Reordering for Dataflow Safety of Datalog. PPDP 2018: 9:1-9:17 - 2016
- [c17]Alan Mycroft, Dominic A. Orchard, Tomas Petricek:
Effect Systems Revisited - Control-Flow Algebra and Semantics. Semantics, Logics, and Calculi 2016: 1-32 - [c16]Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu:
Combining effects and coeffects via grading. ICFP 2016: 476-489 - [c15]Dominic A. Orchard, Nobuko Yoshida:
Effects as sessions, sessions as effects. POPL 2016: 568-581 - 2015
- [c14]Dominic A. Orchard, Nobuko Yoshida:
Using session types as an effect system. PLACES 2015: 1-13 - 2014
- [c13]Raoul-Gabriel Urma, Dominic A. Orchard, Alan Mycroft:
Programming language evolution workshop report. PLE@ECOOP 2014: 1-3 - [c12]Dominic A. Orchard, Tomas Petricek:
Embedding effect systems in Haskell. Haskell 2014: 13-24 - [c11]Dominic A. Orchard, Andrew C. Rice:
A Computational Science Agenda for Programming Language Research. ICCS 2014: 713-727 - [c10]Samuel Aaron, Dominic A. Orchard, Alan F. Blackwell:
Temporal semantics for a live coding language. FARM@ICFP 2014: 37-47 - [c9]Tomas Petricek, Dominic A. Orchard, Alan Mycroft:
Coeffects: a calculus of context-dependent computation. ICFP 2014: 123-135 - 2013
- [c8]Tomas Petricek, Dominic A. Orchard, Alan Mycroft:
Coeffects: Unified Static Analysis of Context-Dependence. ICALP (2) 2013: 385-397 - [c7]Leaf Petersen, Dominic A. Orchard, Neal Glew:
Automatic SIMD vectorization for Haskell. ICFP 2013: 25-36 - [c6]Dominic A. Orchard, Andrew C. Rice:
Upgrading fortran source code using automatic refactoring. WRT@SPLASH 2013: 29-32 - 2012
- [c5]Dominic A. Orchard, Alan Mycroft:
A Notation for Comonads. IFL 2012: 1-17 - 2011
- [c4]Dominic A. Orchard:
The four Rs of programming language design. Onward! 2011: 157-162 - [c3]Dominic A. Orchard, Alan Mycroft:
Efficient and Correct Stencil Computation via Pattern Matching and Static Typing. DSL 2011: 68-92 - 2010
- [c2]Dominic A. Orchard, Tom Schrijvers:
Haskell Type Constraints Unleashed. FLOPS 2010: 56-71 - [c1]Dominic A. Orchard, Max Bolingbroke, Alan Mycroft:
Ypnos: declarative, parallel structured grid programming. DAMP 2010: 15-24
Editorship
- 2021
- [e5]Hsiang-Shang Ko, Dominic Orchard:
TyDe 2021: Proceedings of the 6th ACM SIGPLAN International Workshop on Type-Driven Development, Virtual Event, Korea, 22 August 2021. ACM 2021, ISBN 978-1-4503-8616-6 [contents] - [e4]José F. Morales, Dominic A. Orchard:
Practical Aspects of Declarative Languages - 23rd International Symposium, PADL 2021, Copenhagen, Denmark, January 18-19, 2021, Proceedings. Lecture Notes in Computer Science 12548, Springer 2021, ISBN 978-3-030-67437-3 [contents] - 2019
- [e3]Francisco Martins, Dominic Orchard:
Proceedings Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES@ETAPS 2019, Prague, Czech Republic, 7th April 2019. EPTCS 291, 2019 [contents] - 2016
- [e2]Dominic A. Orchard, Nobuko Yoshida:
Proceedings of the Ninth workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES 2016, Eindhoven, The Netherlands, 8th April 2016. EPTCS 211, 2016 [contents] - 2014
- [e1]Raoul-Gabriel Urma, Dominic A. Orchard, Alan Mycroft:
Proceedings of the 1st Workshop on Programming Language Evolution, PLE@ECOOP 2014, Uppsala, Sweden, July 28, 2014. ACM 2014, ISBN 978-1-4503-2887-6 [contents]
Informal and Other Publications
- 2024
- [i12]Victoria Vollmer, Danielle Marshall, Harley Eades III, Dominic Orchard:
A Mixed Linear and Graded Logic: Proofs, Terms, and Models. CoRR abs/2401.17199 (2024) - [i11]Joseph Bond, Cristina David, Minh Nguyen, Dominic Orchard, Roly Perera:
Conjugate operators for transparent, explorable research outputs. CoRR abs/2403.04403 (2024) - [i10]Matthew Danish, Dominic Orchard, Andrew Rice:
Incremental units-of-measure verification. CoRR abs/2406.02174 (2024) - 2023
- [i9]Danielle Marshall, Dominic Orchard:
Graded Modal Types for Integrity and Confidentiality. CoRR abs/2309.04324 (2023) - [i8]Danielle Marshall, Dominic Orchard:
Functional Ownership through Fractional Uniqueness. CoRR abs/2310.18166 (2023) - 2022
- [i7]Laura Bocchi, Dominic Orchard, A. Laura Voinea:
A Theory of Protocol Composition. CoRR abs/2203.02461 (2022) - 2020
- [i6]Harley Eades III, Dominic Orchard:
Grading Adjoint Logic. CoRR abs/2006.08854 (2020) - [i5]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. CoRR abs/2007.11235 (2020) - [i4]Benjamin Moon, Harley Eades III, Dominic Orchard:
Graded Modal Dependent Type Theory. CoRR abs/2010.13163 (2020) - [i3]Dominic Orchard, Mistral Contrastin, Matthew Danish, Andrew Rice:
Guiding user annotations for units-of-measure verification. CoRR abs/2011.06094 (2020) - 2019
- [i2]Li-yao Xia, Dominic Orchard, Meng Wang:
Composing bidirectional programs monadically (with appendices). CoRR abs/1902.06950 (2019) - 2014
- [i1]Dominic A. Orchard, Tomas Petricek, Alan Mycroft:
The semantic marriage of monads and effects. CoRR abs/1401.5391 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
