COMPUTER SCIENCE DOMINIC VERITY CENTRE OF AUSTRALIAN CATEGORY THEORY - PDF document

EXPLORATION AN OF DIAGRAMS IN STRING COMPUTER SCIENCE DOMINIC VERITY CENTRE OF AUSTRALIAN CATEGORY THEORY MACQUARIE UNIVERSITY WORKSHOP DRHE UNIVERSITY OF NEWCASTLE 10k NOVEMBER 2018

VEIT CATEGORY OF FINITE DIMENSIONAL VECTOR SPACES IR PRODUCT TENSOR oOCBASEVi.mg space VECTOR A DUAL Link ITS OODYA.c.BA isyT v v Yin O A nzhm O O 0 u v 9It Hi ImT IYiEuimM csu.it v

V mi nine i Imma i E i i w f r O aEa E Etnn nE nTe

ANAXIOMATISATION OFTRACE SYMMETRC MONOIDAL CATEGORY G I Emma nine Time MONOIDAL OPERATION ON ARROWS EXTRA AN ADD t.tw turns xx V U V U U W TraYuff f O O Homl44uT Tru.uitlomluxou.HU WHAT AXIOMS QUESTION SHOULD SATISFY ABSTRACT TRACE OPERATION THE

EASIER ARE ANSWER TO AXIOMS DIAGRAMMATICALLY WE THINK IF IMAGINE uMqvanou f tru.VE got O t YANK iotoo.mn auuh

SUPERPOSITIONS at t.IE w.xoxi.inos.ivmnnhL I TIGHTENINGI I natural Tru ulf.lg wD TrjfftgyT

SUD D NATURALITY i O Y CVxoh f Tra Truivlf.com yT ABSTRACT WITH A A MONOIDAL CATEGORY Is Atoms THESE TRACE SATISFYING MONOIDAL CATEGORY TRACED A CALLED

ACACCULATIONEXAMPLET i EE't

SLIDING it to THESE OF COMPLETENESS OF PROOF Int CONSTRUCTION THE AXIOMS CONSTRUCTION GENERALISATION OF THE A NUMBERS THE RATIONAL OF

FLOWCHART FLOW GRAPHS CONTROL Google Blockly Flowchart View t T l

ABACUSMAC HINES REVISITED TURING if INANITE A COUNTABLY with MACHINE A EACH OF WHICH REGISTERS OF SET NATURAL Number A CONTAINS THEN For OF NAMES SET or REGSTAS 0 ApiAbESuT S Vor MACHINE STATE IN A Possible Mt INA me of SET STATES STATES

ABAC.US NSTRaCToNsX 2CtljGoTOT REMENTuT 0Ge fix IFx c ijGoT 9EHI ANA pray omwtnhca.li 0 Goto 3 IF 2 Coto 3 1 X X ELSE 1 Goto Z Y t 1 y 3 DEgERufIYfAf

DESTRUCTVEAD NoN Goto 3 IF E O 1 l j Gop 1 f 3 ELN i IF 5 Z Goto o x I j Goto 3 I X ELSE I j Got 4 9 E ft t I g Gop 3 4 Y y Goto 7 IF E O S f lj Goto 6 2 ELSE i I j Got S 6 X x F i ALREADY GETTING This is ONER OUS A LITTLE FLOWCHART WILL A MAYBE CLEARER THINGS MAKE

ti MAKO i nh i.ee i IFtq z o c z K MOVE EDE.to i i fanion c 4 i Ox u I E i 1 E O i s X T l id t l if i 1 e

LA OFFCOWGARTSBA.sk BLOCKS i BUILDING t t as Slee o t f Oo yo O O O ia i I 1 EE.nuE e.a.ir erhuuco J I f f tooo O Iouuh.Eii7aEEIxsmTn CE.im

OPERATORS Fso i7nwM E 11 ftp.oi oEnEoensT on o i no.mwn e m.ca

trees Iliff FEF.EE Enirmwinn

FREELY GENERANS LANGUAGE THIS LF A CATEGONI NATURAL NUMBERS n OBJECTS 1 I Sloc e a I E Cb 1 1 I I E J FjGin r ins Gim I F I I FIG in Home aIi I G F I I Trff in I turns F MI FORMAL IS SOME KIND OF THIS LANGUAGE OF FLOWCHARTS BUT IT LACKS IS THE SEMANTICS WHAT OF THESE FORMAL MEANING LINGUISTIC FLOWCHARTS IN of MECHANICAL TERMS COMPUTATION ALGEBRA WITH WHICH To PROVE THAT FLOWAUNTS DEANO Two THE SAME COMPUTATION

THESEMANTICCIATEGORY AND SETS OF PAI THE CATEGORY PARTIAL FUNCTIONS DIS JOINT UNION 1 for UNIT EMPTY SET A SYMMETRIC MONOIDAL CATEGORY THIS IS ADMITS A CRUCIALLY Per 1 IMPORTANT TRACE COMPUTATIONALLY Vtw f Ut W 5 I F ko IFF an Tra f v a Xi EU AND eien xn Xo AND V U f AND Xiii Osian Xi At Xo pen WE trace oo7 CALL EicTgI f Execution

f t igh n.si W NEVER ITERATING f MAY V US TO LEAD ITS TOTAL f IS EVEN IF TRACE Tray f NEED NOT BE PARTIAL That f IS THE IF ALSO MAY GET Stuck ITERATING IT Process of

ITERATION THE PROPOSITI ABOVE MAKES DEFINED TRACE A SYMMETRIC Pad 1,0 INTO TRACED MONOIDAL CATEGORY I IS THE THIS TMC AN OF EXAMPLE UR CATEGORY ITERATION

THESEMANTICFUNCTOI PAR D It Lf O O II.to fE Ef w Stole State Stole IIe I copies n State e 1 State Escoe EeDs S s xi 1 i

Stole state State IICCHI IF 5lb O S finds in G s b IF to State State State II JD s imacs c S in Cs 1 EFD IIF's GI IIGIo ai n m E nu t TIGA IIF I IIF I GI IFI II TRIFID Triffema SEMANTICS THAT This WE SAY COMPOSITIONALLY DEFINED IS

Proposition FUNCTION PARTIAL A State f State DESCRIBES THE INPUT OUTPUT BEHAVIOUR IFF THEN AN ABACUS MACHINE OF IN Le 1 I F SOME EXISTS LIFT D f with

Proposition EQUIVALENCE TAKING ON OF Lf ARROWS OF CLASSES EQUIVALENCE THE UNDER RELATION EGI EFI G F n CATEGORY Fter A GET WE A TRACED MONOIDAL INHERITS THIS From Pad STRUCTURE CATEGORY THE IS WITH COMPATIBLE WHICH of THE MEANINGS INTENDED AND Trt D FIG FjG combinations OF TMC FLOWCHARTS THE THIS IS OF COMPUTATION NOTION THIS FOR

WE MIGHT IDGITIFY NOW FLOWCHART DIA WITH Arms TMC Flow THE DIAartms IN MANY ALGEBRAIC PROPERTIES MAY BE FLOWCHARTS OF From DERIVED THE TMC FORMALISM Flowchthts THAT ARE SHOWN BE TMC Earth USING TO DIAGRAMMATIC REASONING DEFINE MACHINE THE SAME

EXAMPLE t ai c An AND G Don'T F Air INVOLVE v e O Y

COMPUTATONAL DERIVABLE SOME PRINCIPLES ah got I O i IE 9

t II THIS CALL WRITERS COMPILER EQUATION LAST CODE ELIMINATION DEAD

ARGUMENT BY CASES FINALLY 1 IF HIEI is ionising b OF VALUE ftp.t.J A YEE

THE I i D the IN Te

whim i i 1 4 I Iif t

b fo OUR DUALLY WHEN FCowanest REDUCES T THE t RULE ARGUMENT BY CASES APPLYING THE SO REDUCES To ORIGINAL FLOWCHART i OUR THE ORIGINAL NOTE c IN Vocab FLOWCHART t U RISE TO A GIVE J ITERATIVE ALGORITHM TALSETEEDBA.CI Lf

MATHIESEN TOLNA ARMAN MARTIN show THAT FRAMEWORK This to USE ARISE From LOGS HOARE FLOYD PRESERVING Funigors CERTAIN TRACE A GENERAL FRAMEWORK FOR COMPLETE FLOYD HOARE Locks SOUND ACM TRANSACTIONS OCT 2009 HYLAND 7 Proof of ABSTRACT AN PROVIDES OF TERMS KLEENE'S THEOREM IN FUNCTOR FROM A TRACE PRESERVING STATE AUTOMATA FINITE REGULAR LANGUAGES TO MODELS CONCRETE ABSTRACT 8008 RECURSION FOR JUNG GHICA THE MODELLING APPLICATIONS TO VARIOUS CIRCUITS DIGITAL OF OF SYNTHESIS THE GEOMETRY