Dominic Orchard

Name:	Dominic Orchard
Affiliation:	University of Cambridge
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	Wed Nov 06 14:18:25 +0000 2024

Public lists managed by Dominic Orchard

Talks given by Dominic Orchard

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

• Writing Computational Models that are FAIR and VRAI
• An introduction to pi-calculus
• Embedding effect systems in Haskell
• A computational science agenda for programming language research
• Upgrading Fortran source code using automatic refactoring
• Automatic SIMD vectorization for Haskell
• Programs in context
• A Notation for Comonads
• Mathematical Structures for Data Types with Restricted Parametericity
• Efficient and Correct Stencil Computations via Pattern Matching and Type Checking
• When Monads and Comonads Overlap
• Programming with Comonads and Codo Notation
• Vectorisation via Equational Rewriting
• Mathematically Structuring Programming Languages
• Functional programming with monads combined with comonads
• Mathematically Structuring Programming Languages
• Haskell Type Constraints Unleashed
• Ypnos: Declarative, Parallel Structured Grid Programming
• Informal Tutorial: Haskell's Type Classes and Type Families
• Interoperation of Lucid's Dataflow paradigm and Object-orientation with a Coalgebraic Semantics

Talks organised by Dominic Orchard

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Dominic Orchard actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Program Verification Using Cyclic Proof
• Gotta Go Fast: Futhark - A Data-Parallel Purely Functional Language and its Optimising GPGPU Compiler
• Dependent types, linear types and operating systems
• Meeting on Testing and Verification for Computational Science
• Biggest Challenges for Kotlin: Interoperability and Tooling
• Brand Objects and Gradual Contracts
• A Core Quantitative Coeffect Calculus
• A Core Quantitative Coeffect Calculus
• Automatic SIMD vectorization for Haskell
• Denotation of Contextual Modal Type theory
• The Whiley Programming Language: Design & Implementation
• Control Flow Analysis for the Join Calculus
• Syntax Matters: Writing abstract computations in F#
• MPhil Presentations: (1) An investigation of the Join Calculus Abstract Machine (2) Ownership in Object-Oriented Languages
• Evaluation strategies for monadic computations
• Using the OpenJDK to investigate covariance in Java
• Virtual machines should be invisible (and might be augmented)
• Wool: low overhead work stealing for fine grain parallelism.
• Coeffect Systems and Typing (Preliminary report)
• Efficient and Correct Stencil Computations via Pattern Matching and Type Checking
• Petri-nets as an Intermediate Representation for Heterogeneous Architectures
• Practice talks
• When Monads and Comonads Overlap
• Programming with Comonads and Codo Notation
• Functional Programming for the Data Centre
• Petri-nets as an Intermediate Representation for Heterogeneous Architectures
• Joinads: a retargetable control-flow construct for reactive, parallel and concurrent programming
• Specification, Implementation and Verification of Refactorings
• Idris --- Systems Programming Meets Full Dependent Types
• Pluggable Type System with Optional Runtime Monitoring of Type Errors
• QuickSpec -- Guessing Formal Specifications using Testing
• Estimating and Exploiting Potential Parallelism by Source-level Dependence Profiling
• Supercompilation by evaluation
• Functional programming with monads combined with comonads
• System Tests from Unit Tests
• Alore: Making dynamic languages simpler
• Informal Tutorial: Haskell's Type Classes and Type Families
• Intelligent Thread-Level Speculation
• Monadic Constraint Programming
• Studying task-level parallelism in C programs using Embla (work in progress)
• Types are calling conventions
• Dictionaries: lazy or strict type class witnesses?
• Cake: a language for adapting and linking mismatched binary components
• Beginning of term introductory meeting
• Type (re)construction from values
• Interoperation of Lucid's Dataflow paradigm and Object-orientation with a Coalgebraic Semantics
• Painless Parse Errors
• Programming for Mamba