数据空间规划 Data Spatial Programming

DataSpatialProgramming

JASONMARS,UniversityofMichigan,USA

Weintroduceanovelprogrammingmodel,DataSpatialProgramming,whichextendsthesemanticsofObject-OrientedProgramming(OOP)byintroducingnewclass-likeconstructscalledarchetypes.Thesearchetypesencapsulatethetopologicalrelationshipsbetweendataentitiesandtheexecutionflowinastruc-turedmanner,enablingmoreexpressiveandsemanticallyrichcomputationsoverinterconnecteddatastruc-turesorfinitestates.Byformalizingtherelationshipsbetweendataelementsinthistopologicalspace,ourap-proachallowsformoreintuitivemodelingofcomplexsystemswhereatopologyofconnectionsisformedfortheunderlyingcomputationalmodel.ThisparadigmaddresseslimitationsintraditionalOOPwhenrepresent-ingawiderangeofproblemsincomputersciencesuchasagent-basedsystems,socialnetworks,processingonrelationaldata,neuralnetworks,distributedsystems,finitestatemachines,andotherspatially-orientedcomputationalproblems.

1INTRODUCTION

Asmodernsoftwaresystemsgrowincreasinglycomplexandinterconnected,traditionalprogram-mingparadigmsoftenstruggletorepresenttherichspatialandtopologicalrelationshipsinher-entinmanyproblemdomains.WhileObject-OrientedProgramming(OOP)hasservedasadomi-nantparadigmfordecades,itfacessignificantlimitationswhenmodelingsystemswithinherentlygraph-likestructures,dynamictraversalpatterns,orcontext-dependentbehaviors.Theselimita-tionsbecomeparticularlypronouncedindomainssuchassocialnetworks,agent-basedsystems,

neuralnetworks,andothertopologically-orientedcomputationalproblems.

Traditionalprogrammingmodels,includingprocedural,functional,andobject-orientedparadigms,typicallyseparatedatastructuresfromthealgorithmsthatmanipulatethem.Inthisconventional

model,dataflowstocomputationthroughparameterpassingandreturnvalues,withalgorithmsremainingstationaryinfunctionsandmethods.This"data-to-compute"programmingmodelispervasive,beingubiquioutousattheprogramminginterfaceandcanevenbefoundasafunda-mentallyembeddedpresuppositioninthevonNeumanncomputerdesignitself,wheredataismovedfrommemorytotheCPUforprocessing.Notablyabsentfromtheprogramminglanguagelandscapeisasystemoflanguageconstructsthatnaturallysupportsacomplementary"compute-to-data"paradigmwhilemaintainingcompatibilitywithconventionalpopularprogramminglan-guages.Thelackofsuchaprogrammingmodelcreatesfrictionwhenrepresentingawiderangeofcomputationalproblemswhere:

●Thetopologyofconnectionsiscentraltotheunderlyingcomputationalmodel

·Computationlogicallyflowsthroughanetworkofinterconnectedentities

●Behavioriscontext-dependentbasedontightcouplingsbetweendataandcompute

●Traversalpatternsarecomplexanddynamicallydetermined

Thoughgraphalgorithmsanddatastructurelibrariescanbeconstructedinmostprogramminglanguages,theyremainsecondarycitizens,withoutfirst-classlanguagesupportfortopologicalsemantics.Thisforcesdeveloperstoimplementcomplextraversallogic,maintaingraphintegrity,andmanageeventpropagationthroughad-hocmechanismsthatareoftenerror-proneanddifficulttomaintain.

Toaddressthesechallenges,weintroduceDataSpatialProgramming(DSP),anovelprogram-mingmodelthatfundamentallyinvertstherelationshipbetweendataandcomputation.Ratherthanmovingdatatostationarycomputationunits(asintraditionalprogramming),DSPenables

Author'saddress:JasonMars,UniversityofMichigan,2260HaywardSt.,AnnArbor,Mighigan,USA,48104,profmars@.

2JasonMars

computationtomovetodatathroughtopologically-awareconstructs.ThisparadigmextendsthesemanticsofObject-OrientedProgrammingbyintroducingspecializedclass-likeconstructscalledarchetypesthatformalizespatialandtopologicalrelationshipswithintheprogrammingmodelitself.

AtthecoreofDataSpatialProgrammingarefourkeyarchetypesthatextendtraditionalclasssemantics:

(1)ObjectClasses(Tobj):Theuniversalsupertypefromwhichallotherarchetypesinherit,providingbackwardcompatibilitywithtraditionalOOPconcepts.

(2)NodeClasses(Tnode):Extensionsofobjectclassesthatrepresentdiscretelocationsorenti-tieswithinatopologicalstructure,capableofhostingcomputationandconnectingtoothernodes.

(3)EdgeClasses(Tedge):First-classentitiesthatrepresentdirectedrelationshipsbetweennodes,encodingboththetopologyofconnectionsandthesemanticsofthoserelationships.

(4)WalkerClasses(Twalker):Autonomouscomputationalentitiesthattraversethenode-edgestructure,carryingstateandbehaviorsthatexecuteastheyvisitdifferentnodes.

Together,thesearchetypescreateacompletetopologicalrepresentationframeworkwheredata(innodes),relationships(asedges),andcomputationalprocesses(throughwalkers)areexplicitlymodeledandintegrated.Thisintegrationenablesaparadigmshiftfrom"datamovingtocomputa-tion"to"computationmovingtodata."

TheDSPparadigmofferssignificantadvantagesforawiderangeofapplications,includingbutnotlimitedto:foragent-basedsystems,walkersprovideadirectrepresentationforautonomousagentsthatnavigateenvironments,gatherinformation,andmakedecisionsbasedonlocalcontext;indistributedsystems,thedecouplingofdata(nodes)fromcomputation(walkers)createsanaturalmodelfordistributedexecutionwherecomputationaltaskscanmovebetweendatalocations;insocialnetworksandgraph-basedsystems,itenablesintuitiverepresentationsofcomplexsocialstructuresthroughthenaturalmappingofusers,relationships,andcontenttonodesandedges;andforfinitestatemachines,statesmapnaturallytonodes,transitionstoedges,andexecutionflowtowalkertraversal,creatingacleanrepresentationofstate-basedsystems.Theseexamplesrepresentjustafewofthepotentialapplications,astheparadigm'sflexibilityextendstonumerousotherdomains.Byformalizingthesetopologicalrelationshipsatthelanguagelevel,DSPenablesmoreexpressive,maintainable,andsemanticallyrichprogramsfordomainswhereconnectiontopologyisafundamentalaspectoftheproblemspace.

Thispapermakesthefollowingcontributions:

(1)WeformalizeDataSpatialProgrammingasanextensiontoObject-OrientedProgramming,introducingfourdistinctarchetypes:objectclasses,nodeclasses,edgeclasses,andwalkerclasses.

(2)Wedefineasemanticmodelthatspecifieshowthesearchetypesinteract,includinginstan-tiationrules,lifecyclemanagement,andexecutionsemanticsfortraversaloperations.

(3)Weintroducespecializedoperatorsandstatementsfordataspatialexecution,includingthespawnoperator(一)foractivatingcomputationalentitiesandthevisitstatement(p)fortraversingtopologicalstructures.

(4)Wepresenttheconceptofabilitiesasanewfunctiontypewithimplicitexecutionseman-tics,triggeredbyspatialeventsratherthanexplicitinvocation.

(5)WedemonstratethepracticalapplicationofDSPthroughacasestudyofasocialmediaapplicationthatnaturallymapsdomainconceptstodataspatialconstructs.

Theremainderofthispaperisorganizedasfollows:Section2formalizesthesemanticelementsoftheDSPmodel,includingarchetypes,executionsemantics,andabilitydefinitions.Section??

DataSpatialProgramming3

presentsadetailedcasestudyofasocialmediaapplicationimplementedinJac,alanguagethatembodiestheDSPparadigm.Weconcludewithadiscussionofimplementationconsiderationsandfuturedirectionsforresearchinthisemergingprogrammingparadigm.

2DATASPATIALSEMANTICS

ThefoundationalconceptofDataSpatialProgrammingistheformalizationoftopologicalrelation-shipsthroughspecialclasstypesandoperators.ThissectionoutlinesthecoresemanticelementsoftheDSPmodel,whichfundamentallyinvertsthetraditionalrelationshipbetweendataandcom-putation.

2.1ArchetypesofClasses

Wedefinefourdistinctarchetypeclasses,extendingthetraditionalclassparadigmtoincorporatespatialsemantics:

(1)ObjectClasses(Tobj):Theseareconventionalclasses,analogoustotraditionalOOPclasstypes.Theyserveasthefoundationalbuildingblocksfromwhichotherarchetypesderive,maintainingbackwardcompatibilitywithexistingOOPconceptswhileenablingintegra-tionwithdataspatialextensions.

(2)NodeClasses(Tnode):Theseextendobjectclassesandcanbeconnectedviaedges.Nodesrepresentdiscretelocationsorentitieswithinatopologicalgraphstructure.Theyencap-sulatedata,compute,andthepotentialforconnections,servingasanchoringpointsinthedataspatialtopologyoftheprogram.Nodescanhavepropertiesthatdescribetheirin-trinsiccharacteristicsandmethodsthatoperateonthoseproperties.Critically,nodesbindcomputationtodatalocations,allowingexecutiontobetriggeredbyvisitationratherthanexplicitinvocation.

(3)EdgeClasses(Tedge):Theserepresentdirectedrelationshipsbetweentwonodeinstancesandcanonlybeinstantiatedwhentwonodesarespecified.Edgesencodeboththetopol-ogyofconnectionsandthesemanticsofthoseconnections.UnlikesimplereferencesintraditionalOOP,edgesarefirst-classobjectentitieswiththeirownpropertiesandbehav-iors,enablingrichmodelingofconnectiontypes,weights,capacities,orotherrelationshipattributes.

(4)WalkerClasses(Twalker):Thesemodelautonomousentitiesthattraversenodeobjects,con-strainedbyedges.Walkersrepresentactivecomputationalelementsthatmovethroughthedatatopologicalstructure,processingdataortriggeringbehaviorsastheyvisitdifferentnodes.Theyenabledecouplingoftraversallogicfromdatastructure,allowingformodu-larityinalgorithmdesignandimplementation.WalkersembodytheparadigmshiftofDSP,carryingcomputationalbehaviorstodataratherthandatabeingpassedtocomputation.

Thisarchetypesystemcreatesacompletetopologicalrepresentationframework,wheredata(innodes),relationships(asedges),andcomputationalprocesses(throughwalkers)areallexplicitlymodeledandintegrated,invertingthetraditionalparadigmofpassingdatatofunctions.

2.1.1Formalization.LetCbethesetofallclassdefinitionsintheprogrammingmodel,where:

(1)Tobj∈Cisastandardobjectclasstype,representingtheuniversalsupertypefromwhichallotherarchetypesinherit.

(2)TnodeSTobjrepresentsnodeclasstypes,whichextendobjectclasseswithconnectivitycapabilitiesanddata-boundcomputation.Thissubsetrelationshipensuresthatnodesin-heritallcapabilitiesofobjectswhileaddingtopologicalsemanticsandtheabilitytobindcomputationtodatalocations.

4JasonMars

(3)TedgeSTobjrepresentsedgeclasstypes,whichextendobjectclasseswithrelationalseman-tics.Edgesarenotmerelyreferencesbutfull-fledgedobjectsthatencapsulaterelationshippropertiesandbehaviors.

(4)TwalkerSTobjrepresentswalkerclasstypes,whichextendobjectclasseswithmobilityse-manticswithinthenode-edgestructure.Walkerscombinedata,state,andtraversallogictomodelcomputationalprocessesthatflowthroughthetopologicalstructure,actualizingtheconceptof"computationmovingtodata."

EachinstanceoofanedgeclassTedgeisdefinedasatuple:

Oedge=(nsrc,ndst,d)

where:

·Nsrc,Ndst∈Tnodearethesourceanddestinationnodeinstances,servingastheendpointsoftherelationship.Thesemustexistpriortoedgecreation,establishingadependencyconstraintthatmaintainsdataspatialgraphintegrity.

·d∈{forward,backward,bidirectional}specifiestheedgedirection,determininghowwalk-ersmaytraversethisconnection.Thisdirectionalpropertyenablesmodelingofasymmet-ricrelationshipsandconstrainedtraversalpathswithinthetopologicalstructure.

Thisformalizationensuresthatedgesproperlyconnectexistingnodesandclearlydefinetraver-salpermissions,maintainingtopologicalgraphconsistencywithintheprogram.

EachinstancewofawalkerclassTwalkermayexistinoneoftwostates:

wherenloc∈Tnodeisthenodethewalkerresidesonwhenactive.Thislocationpropertyisdynamicandchangesasthewalkertraversesthetopologicalstructure,allowingthewalkertoaccessdifferentdatacontextsbasedonitscurrentposition.Wheninactive,thewalkerexistsasastandardobjectwithoutdataspatialcontext,allowingformanipulationbeforeactivationwithinadataspatialcontext.

2.2ExecutionSemantics

TheexecutionmodelofDataSpatialProgrammingcombinestraditionalmethodinvocationwithdataspatialtraversaloperationsandcontext-sensitiveexecution.Thissectiondetailshowinstancesarecreatedandhowcomputationflowsthroughthetopologicalstructure,fundamentallyinvertingthetraditionalrelationshipwheredataismovedtocomputation.

2.2.1InstantiationRules.Tomaintaindataspatialgraphconsistency,DSPenforcesspecificin-stantiationconstraintsfordifferentarchetypes:

(1)ObjectInstantiation:StandardobjectsfollowtraditionalOOPinstantiationpatterns,withconstructorsdefininginitialstate.

(2)NodeInstantiation:Nodesareinstantiatedlikestandardobjectsbutgaintheadditionalcapabilitytoserveasendpointsforedgesandhostsforwalkers.Theirconstructorsmayinitializedataspatialpropertiesandconnectioncapabilities.Nodeseffectivelybecomelo-cationswheredataresidesandcomputationcanbetriggered,ratherthanpassivedata

containers.

DataSpatialProgramming5

(3)EdgeInstantiation:AninstanceeofanedgeclassTedgecanonlybecreatediftwonodesnsre,Ndstexistandarespecifieduponinstantiation.Thisconstraintensuresthatedgesal-waysconnectexistingdataspatialelements,preventingdanglingconnectionsandmain-tainingreferentialintegritywithinthetopologicalstructure.

(4)WalkerInstantiation:AninstancewofawalkerclassTwalkercanbeinstantiatedasastandardobjectwithoutaninitiallocation.Inthisstate,thewalkerfunctionsasaregularobjectwithallitspropertiesandmethodsaccessible,butitdoesnotparticipateindataspatialtraversaluntilactivatedviathespawnoperator.Walkersencapsulatecomputationalbehaviorsthatwillbecarriedthroughthedatastructure,embodyingthe"computationmovestodata"paradigm.

Theseinstantiationrulesprovideflexibilityforwalkerinitializationandpreparationbeforeacti-vationwithinthetopologicalstructure,whilemaintainingtheintegrityofthedataspatialtopologythroughoutprogramexecution.

2.2.2LifecycleManagement.DSPextendstraditionalobjectlifecyclemanagementwithspecial-izedrulesfordataspatialarchetypes:

ObjectLifecycle.:StandardobjectinstancesfollowtraditionalobjectlifecyclepatternsfromOOP,withstandardcreation,usage,andgarbagecollection.

WalkerLifecycle.:Walkershaveaduallifecycle,existingfirstasstandardobjectsandthenpo-tentiallytransitioningtoactivedataspatialentitiesthroughthespawnoperator.Whenactivewithinthetopologicalstructure,walkersmaintaintheirpositionandtraversalstate.Theycanbedeactivatedandreturntostandardobjectstatusunderprogramcontrolorwhentheirtraversalcompletes.ThislifecyclereflectsthemobilenatureofcomputationinDSP,wherealgorithmicbe-haviorsphysicallymovethroughthedatatopology.

NodeLifecycle.:Whenanodeinstanceisdeleted,alledgeinstancesthatconnecttoorfromthatnodeareautomaticallydeletedaswell.Thiscascadingdeletionensuresdataspatialintegritybypreventingdanglingedgesthatwouldotherwisereferencenon-existentnodes.Thisconstraintisexpressedformallyas:

Ve∈Tedgewheree=(nsrec,nast,d):del(nsre)Vdel(ndst)→del(e)

EdgeLifecycle.:Edgeinstancesexistaslongasboththeirsourceanddestinationnodesexist.

Theyareautomaticallygarbagecollectedwheneitherendpointnodeisdeleted,orwhenexplicitlydeletedbytheprogram.

Thislifecyclemanagementsystemensuresthatthetopologicalstructureremainsconsistentthroughoutprogramexecution,withautomaticcleanupofdependentconnectionswhennodesareremoved,whileprovidingflexibilityforwalkeractivationanddeactivation.

2.2.3SpawnOperator(一).Thespawnoperator(→)activatesawalkerwithinthetopologicalstructurebyplacingitataspecifiednode.Thisoperationtransitionsthewalkerfromastandardobjectstatetoanactivedataspatialentity:

w→n→w'

where:

·wisawalkerinstancecurrentlyinaninactivestate

·n∈Tnodeisthenodewherethewalkerwillbespawned

·w′=(n)istheresultingactivewalkerpositionedatnoden

6JasonMars

Thespawnoperationhasseveralimportantproperties:

●Itcanonlybeappliedtoawalkerthatisnotalreadyactivewithinthetopologicalstructure

·Whenexecuted,thewalkertransitionstoactivestatusandispositionedatthespecifiednode

●Theoperationtriggersallentryabilitiesassociatedwiththewalker'sarrivalatthespawnnode

·Afterspawning,thewalkerbeginsitsdataspatialexecution,abletotraversethestructureusingthevisitoperator

Thespawnoperatorcreatesaclearseparationbetweentheinitializationandactivationphasesofwalkerusage,allowingforcomplexsetupbeforedataspatialtraversalbegins.Italsomarksthemomentwhenacomputationalentitybeginsactivelymovingthroughdata,ratherthandatabeingpassedtocomputation.

2.2.4VisitStatement().Thevisitstatement(p)enablesawalkertomovebetweennodesalongspecifiededges,representingthedynamictraversalcapabilitythatiscentraltotheDSPmodel.Thisstatementproducessideeffectsbyaddingdestinationstothewalker'straversalqueueandcanbeappliedtotraverseeitherasingleedgeormultipleedgesinsequence:

SingleEdgeTraversal.

WDe→Ndst

wheree=(nsre,ndst,d)andw=(nsre),meaningthatthewalkeratnsremovestondstfollowingedgee.

MultipleEdgeTraversal.

wp{e1,e₂,…,ek}→{ndst₁,ndst₂,…,ndstk}

whereeachei=(nsrc,ndst;,di)representsavalidedgethatthewalkercantraversefromitscurrentpositionorfromsubsequentnodesreachedduringtraversal.

Thevisitstatementhasseveralimportantproperties:

(1)Itisonlyvalidifthewalkeriscurrentlyactiveandlocatedatthesourcenodeofthefirstedgeinthetraversalsequence.

(2)Eachedgeinthesequencemustpermittraversalintherequireddirection(asspecifiedbythedirectionparameterd).

(3)Whenexecuted,thewalkerqueuesupalldestinationnodes{ndst₁,ndst₂,…,ndstk}tovisitaftercompletingexecutionatitscurrentlocation.Thesedestinationsformatraversalqueuethatdeterminesthewalker'sfuturepath.

(4)Oncethewalkercompletesexecutingallexitabilitiesatitscurrentlocation,itwillmovetothefirstqueueddestinationnodeandtriggerallrelevantentryabilitiesatthatnewlocation.

(5)Thisprocesscontinuesrecursively,withthewalkermovingthroughallqueuednodeloca-tionsuntiltherearenomoredestinationsinitsqueue.

(6)Multiplecallstothevisitstatementappenddestinationstothewalker'sexistingqueue,allowingfordynamicconstructionoftraversalpathsduringexecution.

Thevisitstatementenablesprogrammaticexpressionofcomplextraversalpaths,allowingalgo-rithmstonavigatethetopologicalstructureinacontrolledandsemanticallymeaningfulway.Byqueuingupmultipledestinations,thevisitstatementsupportsbreadth-first,depth-first,orcustomtraversalstrategiesthroughthetopologicalstructure.Thisembodimentofcomputationmovingtodatacreatesafundamentallydifferentprogrammingmodelcomparedtoconventionalapproacheswheredataispassedtostationaryfunctions.

DataSpatialProgramming7

2.2.5AdditionalFlowControlStatements.Toprovidefinercontroloverwalkertraversalexecu-tion,DSPincludestwoadditionalspecializedflowcontrolstatementsthatoperatewithinthecon-textofdataspatialexecution:

SkipStatement.Theskipstatementallowsawalkertoimmediatelyterminateexecutionatitscurrentnodeandproceedtothenextnodeinitstraversalqueue:

skip(w)→end(ncurrent)^begin(nnext)

where:

●wistheactivewalkerinstance

·ncurrentisthecurrentnodethewalkerisexecutingon

·Nnextisthenextnodeinthewalker'straversalqueue

Whenaskipstatementisexecuted:

●Allremainingabilityexecutionatthecurrentnodeisimmediatelyterminated

●Anyexitabilitiesthathavenotyetexecutedatthecurrentnodeareskipped

●Thewalkerimmediatelymovestothenextnodeinitsqueue

·Normalentryabilityexecutionbeginsatthenewnodelocation

Theskipstatementisanalogoustothecontinuestatementintraditionalloopconstructs,allow-ingthewalkertoabortprocessingatthecurrentnodewhilecontinuingitsoveralltraversal.Thisenablesefficientimplementationofconditionalprocessinglogicwherecertainnodesmightbeexaminedbutnotfullyprocesseddependingontheirpropertiesorthewalker'sstate.

DisengageStatement.Thedisengagestatementallowsawalkertoimmediatelyterminateitsentiredataspatialtraversalandreturntoanobjectstate:

disengage(w)→w'

where:

·w=(n1oc)istheactivewalkerinstanceatsomenodelocation

·w′=()istheresultinginactivewalkerinobjectstate

Whenadisengagestatementisexecuted:

·Allremainingabilityexecutionatthecurrentnodeisimmediatelyterminated

·Anyexitabilitiesthathavenotyetexecutedatthecurrentnodeareskipped

●Thewalker'sentiretraversalqueueiscleared

●Thewalkerimmediatelytransitionsfromactivedataspatialentitytoinactiveobjectstate

●Thewalkerretainsallitspropertiesanddatafromitstraversal

Thedisengagestatementisanalogoustothebreakstatementintraditionalloopconstructs,al-lowingthewalkertocompletelyexititsdataspatialexecution.Thisenablesearlyterminationoftraversalswhencertainconditionsaremet,suchasfindingatargetnode,completingacomputa-tion,orencounteringanerrorcondition.

Togetherwiththevisitstatement,theseflowcontrolstatementsprovideessentialmechanismsforimplementingcomplextraversalalgorithmswherethepathandprocessinglogicmayneedtoadaptdynamicallybasedondiscoveredconditionswithinthetopologicalstructure.

2.3Abilities

Inadditiontotraditionalmethodsm:T→t′,weintroduceabilities,anewfunctiontypea:Ø→Øwithimplicitexecutionsemantics.Unlikeordinaryfunctions,abilitiesneitheracceptexplicitargumentsnorreturnvalues;instead,theygainaccesstorelevantdatathroughthewalker

8JasonMars

ornodethattriggersthem.Thisrepresentsafundamentalparadigmshift:ratherthanmovingdatatocomputationthroughparametersandreturnvalues,computationistightlycoupledwithdataandautomaticallytriggeredbydataspatialinteractions.Abilitiesarenamedusingthesameconventionsasmethods,providingaconsistentinterfacepatternacrosstheprogrammingmodel.

Eachabilitynowspecifiesanexecutiontriggerthatdetermineswhenitisactivatedduringtra-versal:

·WalkerAbilitiesawalkerareautomaticallytriggeredwhenawalkerentersorexitsanodeofaspecifiedtype:

awalker:(Tnode,t)→1

wheret∈{entry,exit}specifieswhethertheabilityistriggereduponthewalker'sentrytoorexitfromanodeoftypeTnode.Thisnotationindicatestheconditionunderwhichtheabilityisinvoked,ratherthanaparameterlist.Theabilitythusactsasaneventhandlerfornodearrivalordepartureevents.Onceinvoked,theabilitycandirectlyaccessthetrig-geringwalker'sdata(viaself)andthenodeitarrivedatorisdepartingfrom(viahere).Thisallowswalkerstorespondcontextuallytodifferentnodetypestheyencounter,imple-mentingtype-specificprocessinglogicwithoutexplicitconditionalbranching.Thewalkerembodiescomputationthatmovesthroughthedatatopology,accessingandmanipulatingdataateachlocationitvisits.

·NodeAbilitiesanodeareautomaticallytriggeredwhenawalkerofaspecifiedtypeentersorexitsthenode:

anode:(Twalker,t)→1

wheret∈{entry,exit}specifieswhethertheabilityistriggereduponthewalker'sentrytoorexitfromthenode.Similarly,thisindicatesthecondition(arrivalordepartureofawalkeroftypeTwalker),notanexplicitparameter.Theabilityfunctionsasaneventhandlerforwalkerarrivalordepartureevents.Whentriggered,theabilitycanaccessthenode'sdata(viaself)andtheincomingoroutgoingwalker(viahere).Thisallowsnodestoresponddifferentlytodifferenttypesofwalkers,implementingspecializedprocessinglogicbasedonthevisitortypeandtraversalstage.Nodeabilitiesrepresentcomputationthatisboundtodatalocationsandautomaticallytriggeredwhenwalkersvisit,invertingthetraditionalmodelofpassingdatatofunctions.

2.3.1AbilityExecutionOrder.Whenawalkermovesbetweennodes,abilitiesareexecutedinaspecificorderthatrespectsboththeentry/exitspecificationsandthedual-perspectivemodelofnode-walkerinteraction:

(1)Whenawalkerarrivesatanode:

(a)First,allrelevantnodeentryabilitiesforthearrivingwalkertypeareexecuted.Thisallowsthenodetorespondtothewalker'sarrival,potentiallymodifyingitsownstateor