reasonml
play

REASONML DOUGLAS TEOH dteoh.com dteoh #3808 allm.net/en Medical - PowerPoint PPT Presentation

Sep 05, 2022 •207 likes •727 views

Saving lives with REASONML DOUGLAS TEOH dteoh.com dteoh #3808 allm.net/en Medical Device Recalls Software Issues (%) 30 22.5 15 7.5 0 2016 Q1 2016 Q3 2017 Q1 2017 Q3 2018 Q1 2018 Q3 Sourced from Stericycle Expert Solutions Recall

  1. Saving lives with REASONML DOUGLAS TEOH dteoh.com dteoh #3808 allm.net/en

  2. Medical Device Recalls Software Issues (%) 30 22.5 15 7.5 0 2016 Q1 2016 Q3 2017 Q1 2017 Q3 2018 Q1 2018 Q3 Sourced from Stericycle Expert Solutions Recall Index

  3. Therac-25

  4. Fast-ED Android + iOS app

  5. 🧡 Stroke • Ischemic and Hemorrhagic • No oxygen → brain cells die, loss of brain function

  6. Why an app? • One of the leading causes of death • Symptoms observable • Survival correlated with time to treatment

  7. Assessing a stroke?

  12. Fast-ED Android + iOS app

  13. JAVASCRIPT? IN MEDICAL APPS?

  14. APP STRUCTURE

  19. VARIANTS

  20. option(‘a)

  21. MODELLING API DATA

  26. FINDING DOMAIN ERRORS 🔏🐟

  30. Be careful when using option(‘a)

  31. DISAMBIGUATING COMMONLY USED 
 TYPES

  33. REVEALING SYSTEM ERRORS

  34. Belt’s Result.t(‘a, ‘error)

  35. Result.t(‘a, string)

  37. Result.t(‘a, ‘error)

  40. Railway Oriented Programming

  42. INTEROP

  43. Exchange JSON compatible structures

  45. Use Js.Json.t + Js.Json.classify

  47. JS objects • [@bs.deriving “abstract”] for inputs • bs-json library to output Js.Json.t

  49. TESTING with bs-jest

  50. 📧 PACKAGING with Parcel parceljs.org

  51. Saving lives with REASONML DOUGLAS TEOH dteoh.com dteoh #3808 allm.net/en

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

The last racket set-equal redux code-review quiz ReasonML intro Announcement Flu shots

The last racket set-equal redux code-review quiz ReasonML intro Announcement Flu shots

The last racket set-equal redux code-review quiz ReasonML intro Announcement Flu shots today in Sayles Hall Effectiveness substantially reduced if you didn't get a good night's sleep Last time: set equality Represent sets as

476 views • 20 slides
Class 19 review combinatorics bignum ReasonML rapid tour, day 2 Reason so far: Basic

Class 19 review combinatorics bignum ReasonML rapid tour, day 2 Reason so far: Basic

Class 19 review combinatorics bignum ReasonML rapid tour, day 2 Reason so far: Basic types: int, fmoat, string, bool, list(int), list('a), function types [more to come] Builtins: +, etc.; +., etc., fmoat_of_int (and int_of_fmoat,

579 views • 32 slides
Games, etc Warmup: argmin Recursion types Games ReasonML representa6on of games Warmup

Games, etc Warmup: argmin Recursion types Games ReasonML representa6on of games Warmup

Games, etc Warmup: argmin Recursion types Games ReasonML representa6on of games Warmup Find largest square of an item in a nonempty int-list maxSquare([1, 4, 3]); 16 let rec maxSquare: list(int)=>int = fun | [] =>

304 views • 19 slides
Math 211 Math 211 Complex Numbers and Matrices October 29, 2001 2 Complex Numbers Complex

Math 211 Math 211 Complex Numbers and Matrices October 29, 2001 2 Complex Numbers Complex

1 Math 211 Math 211 Complex Numbers and Matrices October 29, 2001 2 Complex Numbers Complex Numbers A complex number is one of the form z = x + iy , where x and y are real numbers. Geometric representation the complex plane. z = x

371 views • 9 slides
Renormalons in Quantum Mechanics Cihan Pazarba s Bo gazi ci University based on

Renormalons in Quantum Mechanics Cihan Pazarba s Bo gazi ci University based on

Renormalons in Quantum Mechanics Cihan Pazarba s Bo gazi ci University based on 1906.07198 collobration with Dieter Van den Bleeken 06.09.2019, ICTP Introduction Perturbative Series are generically divergent f ( ) = f n

566 views • 27 slides
Agenda Grading ELLs FLE ID Accommodations ACCESS Title III Supplemental

Agenda Grading ELLs FLE ID Accommodations ACCESS Title III Supplemental

12/6/17 Bilingual ESOL Department Touch-Base Tuesday Tuesday, December 5, 2017 Agenda Grading ELLs FLE ID Accommodations ACCESS Title III Supplemental Materials Upcoming Meetings Question and Answer 2

480 views • 8 slides
Scalable differential transcript usage analysis for single-cell applications JEROEN GILIS

Scalable differential transcript usage analysis for single-cell applications JEROEN GILIS

Scalable differential transcript usage analysis for single-cell applications JEROEN GILIS EuroBioc2019 presentation Promotor: Prof. Lieven Clement Supervisor: Dr. Koen Van den Berge 1 Di ff erential Transcript Usage (DTU) Translation

902 views • 20 slides
CSE217 INTRODUCTION TO DATA SCIENCE LECTURE 8: SIMILARITY-BASED PREDICTION Spring 2019 Marion

CSE217 INTRODUCTION TO DATA SCIENCE LECTURE 8: SIMILARITY-BASED PREDICTION Spring 2019 Marion

CSE217 INTRODUCTION TO DATA SCIENCE LECTURE 8: SIMILARITY-BASED PREDICTION Spring 2019 Marion Neumann RECAP: CLUSTERING Good clustering high similarity within each group low similarity across the groups minimize distance of each

768 views • 14 slides
Divergent series in quantum mechanics Large-order behavior of the perturbation series: its

Divergent series in quantum mechanics Large-order behavior of the perturbation series: its

1 Divergent series in quantum mechanics Large-order behavior of the perturbation series: its derivation and applications J. Zamastil, J. C zek and L. Sk ala Charles University, Czech Republic University of Waterloo, Canada

343 views • 18 slides
Coalescences of IMBH binaries as sources for the future IMBH binaries as seen by the GW ET

Coalescences of IMBH binaries as sources for the future IMBH binaries as seen by the GW ET

Coalescences of IMBH binaries as sources for the future ET detector Coalescences of IMBH binaries as sources for the future IMBH binaries as seen by the GW ET detector detectors The (disputed) existence of IMBHs Modeling BBH Luca

199 views • 16 slides
PROPERTY-PRESERVING ENCRYPTION GRAD SEC NOV 07 2017 TODAYS PAPERS CRYPTDB BUILDING

PROPERTY-PRESERVING ENCRYPTION GRAD SEC NOV 07 2017 TODAYS PAPERS CRYPTDB BUILDING

PROPERTY-PRESERVING ENCRYPTION GRAD SEC NOV 07 2017 TODAYS PAPERS CRYPTDB BUILDING BLOCKS RND AES+CBC+random IV DET AES+CBC+fixed IV OPE x < y OPE K (x) < OPE K (y) HOM HOM K (x) * HOM K (y) = HOM K (x+y) Fully

793 views • 24 slides
Time and Space Crawling, on the planets face. Space Complexity Some insects, called the human

Time and Space Crawling, on the planets face. Space Complexity Some insects, called the human

Time and Space Crawling, on the planets face. Space Complexity Some insects, called the human race. Lost in time, and lost in space Nabil Mustafa ... and in meaning. Computability and Complexity Rocky Picture Horror Show (1973) Nabil

452 views • 5 slides
Advanced Topics in Theoretical Computer Science Part 5: Complexity (Part 2) 24.01.2018 Viorica

Advanced Topics in Theoretical Computer Science Part 5: Complexity (Part 2) 24.01.2018 Viorica

Advanced Topics in Theoretical Computer Science Part 5: Complexity (Part 2) 24.01.2018 Viorica Sofronie-Stokkermans Universit at Koblenz-Landau e-mail: sofronie@uni-koblenz.de 1 Contents Recall: Turing machines and Turing computability

658 views • 40 slides
Time and Timers The time Epoch The Current Time Sleeping and Waiting Timers

Time and Timers The time Epoch The Current Time Sleeping and Waiting Timers

CPSC-313: Introduction to Computer Systems Time and Timers Time and Timers The time Epoch The Current Time Sleeping and Waiting Timers Reading: R&R, Ch 9 Current Time UNIX Time Zero : 00.00 (midnight), January 1,

244 views • 7 slides
Finding Options that Minimize Planning Time Yuu Jinnai 1 , David Abel 1 , D Ellis Hershkowitz 2 ,

Finding Options that Minimize Planning Time Yuu Jinnai 1 , David Abel 1 , D Ellis Hershkowitz 2 ,

Finding Options that Minimize Planning Time Yuu Jinnai 1 , David Abel 1 , D Ellis Hershkowitz 2 , Michael L. Littman 1 , George Konidaris 1 Brown University 1 , Carnegie Mellon University 2 The problem of finding an optimal set of options that

387 views • 9 slides
Logic, Complexity, and Infinite Computations Olivier Finkel Equipe de Logique Math ematique

Logic, Complexity, and Infinite Computations Olivier Finkel Equipe de Logique Math ematique

Logic, Complexity, and Infinite Computations Olivier Finkel Equipe de Logique Math ematique Institut de Math ematiques de Jussieu - Paris Rive Gauche CNRS and Universit e Paris 7 Workshop on Wadge Theory and Automata Torino, January

1.23k views • 76 slides
Derandomization A Basic Introduction Antonis Antonopoulos CoReLab Seminar National Technical

Derandomization A Basic Introduction Antonis Antonopoulos CoReLab Seminar National Technical

Outline Introduction Circuits PRGs Uniform Derandomization Refs Derandomization A Basic Introduction Antonis Antonopoulos CoReLab Seminar National Technical University of Athens 21/3/2011 Outline Introduction Circuits PRGs Uniform

725 views • 30 slides
An Overview of Computational Complexity

An Overview of Computational Complexity

An Overview of Computational Complexity kazim@fouladi.ir

561 views • 52 slides
An Overview of Complexity Theory 5DV037 Fundamentals of Computer Science Ume a University

An Overview of Complexity Theory 5DV037 Fundamentals of Computer Science Ume a University

An Overview of Complexity Theory 5DV037 Fundamentals of Computer Science Ume a University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner An Overview of Complexity Theory 20101024 Slide

1.98k views • 36 slides
B5.1 Motivation in the size of the transition system (i.e., the number of states). However,

B5.1 Motivation in the size of the transition system (i.e., the number of states). However,

Planning and Optimization October 20, 2016 B5. Computational Complexity of Planning: Background Planning and Optimization B5.1 Motivation B5. Computational Complexity of Planning: Background B5.2 Background: Turing Machines Malte Helmert

89 views • 5 slides
On the Possibility of One-Message Weak Zero-Knowledge Johan Wall en Helsinki University of

On the Possibility of One-Message Weak Zero-Knowledge Johan Wall en Helsinki University of

On the Possibility of One-Message Weak Zero-Knowledge Johan Wall en Helsinki University of Technology Laboratory for Theoretical Computer Science johan@tcs.hut.fi T-79.515 Cryptography: Special Topics March 10, 2005 Introduction We will

607 views • 24 slides
ZFS Performance Analysis and Tools Brendan Gregg Lead Performance Engineer brendan@joyent.com

ZFS Performance Analysis and Tools Brendan Gregg Lead Performance Engineer brendan@joyent.com

ZFS Performance Analysis and Tools Brendan Gregg Lead Performance Engineer brendan@joyent.com @brendangregg October, 2012 Wednesday, October 3, 12 whoami GDay, Im Brendan These days I do systems performance analysis of the

760 views • 65 slides
Peeking Inside Peeking Inside Persistent storage modeled as a sequence of N blocks Persistent

Peeking Inside Peeking Inside Persistent storage modeled as a sequence of N blocks Persistent

Peeking Inside Peeking Inside Persistent storage modeled as a sequence of N blocks Persistent storage modeled as a sequence of N blocks from 0 to N-1 from 0 to N-1 4KB in this example 4KB in this example some blocks store data some blocks store

389 views • 5 slides
Polynomial Identity Testing and Circuit Lower Bounds Robert Spalek, CWI based on papers by

Polynomial Identity Testing and Circuit Lower Bounds Robert Spalek, CWI based on papers by

Polynomial Identity Testing and Circuit Lower Bounds Robert Spalek, CWI based on papers by Nisan & Wigderson, 1994 Kabanets & Impagliazzo, 2003 1 Randomised algorithms For some problems (polynomial identity testing) we know an

304 views • 15 slides

More recommend