@ddse/acm-adapters 0.5.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 DDSE Foundation
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,228 @@
+# @ddse/acm-adapters
+
+Framework adapters for ACM, providing integration with LangGraph and Microsoft Agent Framework.
+
+## Overview
+
+This package provides adapters that allow ACM plans to be executed using popular agent frameworks. The adapters handle the conversion of ACM tasks, guards, and edges into framework-specific constructs while preserving ACM's policy, verification, and streaming capabilities.
+
+## Features
+
+- **LangGraph Adapter**: Convert ACM plans into LangGraph state graphs
+- **MS Agent Framework Adapter**: Execute ACM plans as MS Agent activities
+- Full support for ACM policy hooks and verification
+- Streaming progress updates
+- Memory ledger integration
+
+## Installation
+
+```bash
+pnpm add @ddse/acm-adapters
+```
+
+For LangGraph support, also install:
+```bash
+pnpm add @langchain/langgraph
+```
+
+## Usage
+
+### LangGraph Adapter
+
+```typescript
+import { asLangGraph } from '@ddse/acm-adapters';
+import { executePlan } from '@ddse/acm-runtime';
+
+// Create adapter
+const adapter = asLangGraph({
+  goal,
+  context,
+  plan,
+  capabilityRegistry,
+  toolRegistry,
+  policy,
+  stream,
+  ledger,
+});
+
+// Get graph structure for use with LangGraph
+const { nodes, edges, entryPoint } = adapter.buildGraph();
+
+// Or execute directly (simplified execution)
+const result = await adapter.execute();
+```
+
+### Microsoft Agent Framework Adapter
+
+```typescript
+import { wrapAgentNodes } from '@ddse/acm-adapters';
+
+// Create adapter
+const adapter = wrapAgentNodes({
+  goal,
+  context,
+  plan,
+  capabilityRegistry,
+  toolRegistry,
+  policy,
+  stream,
+  ledger,
+});
+
+// Get activities for MS Agent Framework
+const activities = adapter.getAllActivities();
+
+// Or execute directly
+const result = await adapter.execute();
+```
+
+### Full Example with CLI
+
+```typescript
+import { asLangGraph, wrapAgentNodes } from '@ddse/acm-adapters';
+
+// ... setup goal, context, plan, registries ...
+
+let result;
+
+if (engine === 'langgraph') {
+  const adapter = asLangGraph({
+    goal,
+    context,
+    plan,
+    capabilityRegistry,
+    toolRegistry,
+    policy,
+    stream,
+    ledger,
+  });
+  result = await adapter.execute();
+} else if (engine === 'msaf') {
+  const adapter = wrapAgentNodes({
+    goal,
+    context,
+    plan,
+    capabilityRegistry,
+    toolRegistry,
+    policy,
+    stream,
+    ledger,
+  });
+  result = await adapter.execute();
+} else {
+  // Use standard ACM runtime
+  result = await executePlan({
+    goal,
+    context,
+    plan,
+    capabilityRegistry,
+    toolRegistry,
+    policy,
+    stream,
+    ledger,
+  });
+}
+```
+
+## Features by Adapter
+
+### LangGraph Adapter
+
+The LangGraph adapter converts ACM plans into LangGraph state graphs:
+
+- **Nodes**: Each ACM task becomes a LangGraph node
+- **Edges**: ACM edges with guards become conditional edges
+- **State**: Graph state includes task outputs and context
+- **Execution**: Supports LangGraph's execution engine
+
+**Key Methods:**
+- `buildGraph()`: Get nodes, edges, and entry point
+- `execute()`: Run simplified execution
+
+### MS Agent Framework Adapter
+
+The MS Agent Framework adapter wraps ACM tasks as activities:
+
+- **Activities**: Each ACM task becomes an activity handler
+- **Workflow**: Respects task dependencies via topological sort
+- **Hooks**: Full policy and verification support
+- **Events**: Streaming events for progress tracking
+
+**Key Methods:**
+- `getActivity(taskId)`: Get activity handler for a task
+- `getAllActivities()`: Get all activity handlers
+- `execute()`: Run workflow execution
+
+## Policy and Verification
+
+Both adapters fully support ACM's policy and verification features:
+
+```typescript
+// Policy checks happen before task execution
+const policy = {
+  async evaluate({ action, input, context }) {
+    // Return true to allow, false to deny
+    return input.riskLevel !== 'HIGH';
+  },
+};
+
+// Verification happens after task execution
+class MyTask extends Task {
+  verification() {
+    return ['output.result !== null', 'output.status === "success"'];
+  }
+}
+```
+
+## Streaming
+
+Both adapters emit progress events that can be consumed:
+
+```typescript
+const stream = new DefaultStreamSink();
+stream.attach('task', (update) => {
+  console.log(`Task ${update.taskId}: ${update.status}`);
+});
+
+// Use with adapter
+const adapter = asLangGraph({
+  // ...
+  stream,
+});
+```
+
+## API Reference
+
+### LangGraphAdapter
+
+**Constructor:**
+```typescript
+new LangGraphAdapter(options: LangGraphAdapterOptions)
+```
+
+**Methods:**
+- `buildGraph()`: Returns `{ nodes, edges, entryPoint }`
+- `execute()`: Returns `{ outputs, ledger }`
+
+### MSAgentFrameworkAdapter
+
+**Constructor:**
+```typescript
+new MSAgentFrameworkAdapter(options: MSAgentFrameworkAdapterOptions)
+```
+
+**Methods:**
+- `getActivity(taskId: string)`: Get activity handler
+- `getAllActivities()`: Get all activities as Map
+- `execute()`: Returns `{ outputs, ledger }`
+
+## Notes
+
+- The adapters provide simplified execution modes suitable for ACM use cases
+- For advanced LangGraph features (checkpointing, parallel execution), use the graph structure directly
+- MS Agent Framework adapter uses topological sorting for task ordering
+- Both adapters respect guard expressions for conditional branching
+
+## License
+
+Apache-2.0

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { LangGraphAdapter, asLangGraph, type LangGraphAdapterOptions, type GraphState } from './langgraph.js';
+export { MSAgentFrameworkAdapter, wrapAgentNodes, type MSAgentFrameworkAdapterOptions, type ActivityState } from './msaf.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,KAAK,uBAAuB,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC9G,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,KAAK,8BAA8B,EAAE,KAAK,aAAa,EAAE,MAAM,WAAW,CAAC"}

package/dist/index.js

@@ -0,0 +1,4 @@
+// Framework adapters for ACM
+export { LangGraphAdapter, asLangGraph } from './langgraph.js';
+export { MSAgentFrameworkAdapter, wrapAgentNodes } from './msaf.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAiD,MAAM,gBAAgB,CAAC;AAC9G,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAA2D,MAAM,WAAW,CAAC"}

package/dist/langgraph.d.ts

@@ -0,0 +1,81 @@
+import { type Goal, type Context, type Plan, type CapabilityRegistry, type ToolRegistry, type PolicyEngine, type StreamSink, type NucleusFactory, type NucleusConfig } from '@ddse/acm-sdk';
+import type { MemoryLedger } from '@ddse/acm-runtime';
+/**
+ * LangGraph adapter options
+ */
+export interface LangGraphAdapterOptions {
+    goal: Goal;
+    context: Context;
+    plan: Plan;
+    capabilityRegistry: CapabilityRegistry;
+    toolRegistry: ToolRegistry;
+    policy?: PolicyEngine;
+    stream?: StreamSink;
+    ledger?: MemoryLedger;
+    resumeFrom?: string;
+    checkpointStore?: any;
+    nucleusFactory: NucleusFactory;
+    nucleusConfig: {
+        llmCall: NucleusConfig['llmCall'];
+        hooks?: NucleusConfig['hooks'];
+        allowedTools?: string[];
+    };
+}
+/**
+ * LangGraph node state
+ */
+export interface GraphState {
+    taskId: string;
+    input: any;
+    output?: any;
+    error?: Error;
+    context: Context;
+    outputs: Map<string, any>;
+}
+/**
+ * Convert ACM Plan to LangGraph-compatible structure
+ *
+ * This adapter converts ACM tasks and edges into LangGraph nodes and edges.
+ * Each ACM task becomes a LangGraph node, and guards become conditional edges.
+ */
+export declare class LangGraphAdapter {
+    private options;
+    constructor(options: LangGraphAdapterOptions);
+    /**
+     * Create a LangGraph-compatible node function from an ACM task
+     */
+    private createNodeFunction;
+    /**
+     * Create guard evaluator for conditional edges
+     */
+    private createGuardEvaluator;
+    /**
+     * Build LangGraph structure
+     *
+     * Returns a configuration object that can be used with LangGraph's StateGraph
+     */
+    buildGraph(): {
+        nodes: Map<string, (state: GraphState) => Promise<Partial<GraphState>>>;
+        edges: Array<{
+            from: string;
+            to: string;
+            condition?: (state: GraphState) => boolean;
+        }>;
+        entryPoint: string;
+    };
+    /**
+     * Execute the plan using LangGraph (if available)
+     *
+     * Note: This is a simplified implementation. In practice, you would use
+     * LangGraph's StateGraph API directly with the graph structure.
+     */
+    execute(): Promise<{
+        outputsByTask: Record<string, any>;
+        ledger: readonly any[];
+    }>;
+}
+/**
+ * Helper function to create a LangGraph adapter
+ */
+export declare function asLangGraph(options: LangGraphAdapterOptions): LangGraphAdapter;
+//# sourceMappingURL=langgraph.d.ts.map

package/dist/langgraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"langgraph.d.ts","sourceRoot":"","sources":["../src/langgraph.ts"],"names":[],"mappings":"AACA,OAAO,EAEL,KAAK,IAAI,EACT,KAAK,OAAO,EACZ,KAAK,IAAI,EACT,KAAK,kBAAkB,EACvB,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,UAAU,EAEf,KAAK,cAAc,EACnB,KAAK,aAAa,EACnB,MAAM,eAAe,CAAC;AAEvB,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,IAAI,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,IAAI,CAAC;IACX,kBAAkB,EAAE,kBAAkB,CAAC;IACvC,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,GAAG,CAAC;IACtB,cAAc,EAAE,cAAc,CAAC;IAC/B,aAAa,EAAE;QACb,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC;QAClC,KAAK,CAAC,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;QAC/B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;KACzB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,GAAG,CAAC;IACX,MAAM,CAAC,EAAE,GAAG,CAAC;IACb,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC3B;AAED;;;;;GAKG;AACH,qBAAa,gBAAgB;IACf,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,uBAAuB;IAUpD;;OAEG;IACH,OAAO,CAAC,kBAAkB;IA+H1B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAgB5B;;;;OAIG;IACH,UAAU,IAAI;QACZ,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxE,KAAK,EAAE,KAAK,CAAC;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAC;YAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,OAAO,CAAA;SAAE,CAAC,CAAC;QACvF,UAAU,EAAE,MAAM,CAAC;KACpB;IA8BD;;;;;OAKG;IACG,OAAO,IAAI,OAAO,CAAC;QAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,EAAE,CAAA;KAAE,CAAC;CA0CzF;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,uBAAuB,GAAG,gBAAgB,CAE9E"}

package/dist/langgraph.js

@@ -0,0 +1,222 @@
+// LangGraph Adapter for ACM
+import { InternalContextScopeImpl, } from '@ddse/acm-sdk';
+import { createInstrumentedToolGetter } from '@ddse/acm-runtime';
+/**
+ * Convert ACM Plan to LangGraph-compatible structure
+ *
+ * This adapter converts ACM tasks and edges into LangGraph nodes and edges.
+ * Each ACM task becomes a LangGraph node, and guards become conditional edges.
+ */
+export class LangGraphAdapter {
+    options;
+    constructor(options) {
+        this.options = options;
+        // Warn if resume options are provided but not supported
+        if (options.resumeFrom || options.checkpointStore) {
+            console.warn('⚠️  LangGraph adapter does not support resume functionality. ' +
+                'Use the runtime engine (--engine runtime) for resumable executions.');
+        }
+    }
+    /**
+     * Create a LangGraph-compatible node function from an ACM task
+     */
+    createNodeFunction(taskId) {
+        return async (state) => {
+            const { plan, capabilityRegistry, toolRegistry, policy, stream, ledger } = this.options;
+            // Find task spec in plan
+            const taskSpec = plan.tasks.find((t) => t.id === taskId);
+            if (!taskSpec) {
+                throw new Error(`Task ${taskId} not found in plan`);
+            }
+            try {
+                // Get task implementation
+                const capabilityName = taskSpec.capabilityRef || taskSpec.capability;
+                if (!capabilityName) {
+                    throw new Error(`Task ${taskId} missing capability reference`);
+                }
+                const task = capabilityRegistry.resolve(capabilityName);
+                if (!task) {
+                    throw new Error(`Capability ${capabilityName} not found`);
+                }
+                // Build run context
+                const allowedTools = new Set(this.options.nucleusConfig.allowedTools ?? []);
+                for (const tool of taskSpec.tools ?? []) {
+                    allowedTools.add(tool.name);
+                }
+                const nucleus = this.options.nucleusFactory({
+                    goalId: this.options.goal.id,
+                    goalIntent: this.options.goal.intent,
+                    planId: plan.id,
+                    taskId,
+                    contextRef: plan.contextRef,
+                    context: state.context,
+                    llmCall: this.options.nucleusConfig.llmCall,
+                    hooks: this.options.nucleusConfig.hooks,
+                    allowedTools: Array.from(allowedTools),
+                });
+                const internalScope = new InternalContextScopeImpl(entry => {
+                    this.options.ledger?.append(entry.type, entry.details);
+                });
+                nucleus.setInternalContext(internalScope);
+                const getTool = createInstrumentedToolGetter({
+                    taskId,
+                    capability: capabilityName,
+                    toolRegistry,
+                    ledger: this.options.ledger,
+                });
+                const runContext = {
+                    goal: this.options.goal,
+                    context: state.context,
+                    outputs: Object.fromEntries(state.outputs),
+                    metrics: { costUsd: 0, elapsedSec: 0 },
+                    getTool,
+                    getCapabilityRegistry: () => capabilityRegistry,
+                    stream,
+                    nucleus,
+                    internalContext: internalScope,
+                };
+                const preflight = await nucleus.preflight();
+                if (preflight.status === 'NEEDS_CONTEXT') {
+                    throw new Error(`Task ${taskId} requires additional context retrieval: ${preflight.retrievalDirectives.join(', ')}`);
+                }
+                // Policy pre-check
+                if (policy) {
+                    const policyInput = task.policyInput?.(runContext, taskSpec.input || state.input) || {};
+                    const decision = await policy.evaluate('task.pre', {
+                        action: taskSpec.capability,
+                        input: policyInput,
+                        context: state.context,
+                    });
+                    if (!decision.allow) {
+                        throw new Error(`Policy denied execution of ${taskSpec.capability}`);
+                    }
+                }
+                // Execute task
+                stream?.emit('task', { taskId, status: 'started' });
+                const output = await task.execute(runContext, taskSpec.input || state.input);
+                // Update outputs map
+                const newOutputs = new Map(state.outputs);
+                newOutputs.set(taskId, output);
+                stream?.emit('task', { taskId, status: 'completed', output });
+                // Log to ledger
+                if (ledger) {
+                    ledger.append('TASK_END', { taskId, capability: taskSpec.capability });
+                }
+                const postcheck = await nucleus.postcheck(output);
+                if (postcheck.status === 'NEEDS_COMPENSATION' || postcheck.status === 'ESCALATE') {
+                    throw new Error(`Task ${taskId} postcheck failed: ${postcheck.reason}`);
+                }
+                return {
+                    taskId,
+                    output,
+                    outputs: newOutputs,
+                };
+            }
+            catch (error) {
+                stream?.emit('task', { taskId, status: 'failed', error });
+                if (ledger) {
+                    ledger.append('ERROR', { taskId, error: String(error) });
+                }
+                return {
+                    taskId,
+                    error: error,
+                };
+            }
+        };
+    }
+    /**
+     * Create guard evaluator for conditional edges
+     */
+    createGuardEvaluator(guard) {
+        if (!guard) {
+            return () => true;
+        }
+        return (state) => {
+            try {
+                // Simple guard evaluation
+                const func = new Function('state', 'outputs', `return ${guard}`);
+                return func(state, Object.fromEntries(state.outputs));
+            }
+            catch {
+                return false;
+            }
+        };
+    }
+    /**
+     * Build LangGraph structure
+     *
+     * Returns a configuration object that can be used with LangGraph's StateGraph
+     */
+    buildGraph() {
+        const { plan } = this.options;
+        const nodes = new Map();
+        const edges = [];
+        // Create nodes for each task
+        for (const task of plan.tasks) {
+            nodes.set(task.id, this.createNodeFunction(task.id));
+        }
+        // Create edges
+        for (const edge of plan.edges) {
+            edges.push({
+                from: edge.from,
+                to: edge.to,
+                condition: edge.guard ? this.createGuardEvaluator(edge.guard) : undefined,
+            });
+        }
+        // Find entry point (task with no incoming edges)
+        const hasIncoming = new Set(plan.edges.map((e) => e.to));
+        const entryPoint = plan.tasks.find((t) => !hasIncoming.has(t.id))?.id || plan.tasks[0]?.id;
+        if (!entryPoint) {
+            throw new Error('No entry point found in plan');
+        }
+        return { nodes, edges, entryPoint };
+    }
+    /**
+     * Execute the plan using LangGraph (if available)
+     *
+     * Note: This is a simplified implementation. In practice, you would use
+     * LangGraph's StateGraph API directly with the graph structure.
+     */
+    async execute() {
+        const { nodes, edges, entryPoint } = this.buildGraph();
+        // Initialize state
+        const state = {
+            taskId: entryPoint,
+            input: {},
+            context: this.options.context,
+            outputs: new Map(),
+        };
+        // Simple sequential execution based on edges
+        // In a real implementation, this would use LangGraph's execution engine
+        let currentTaskId = entryPoint;
+        const visited = new Set();
+        while (currentTaskId && !visited.has(currentTaskId)) {
+            visited.add(currentTaskId);
+            const nodeFunc = nodes.get(currentTaskId);
+            if (!nodeFunc)
+                break;
+            const result = await nodeFunc(state);
+            Object.assign(state, result);
+            // Find next task
+            const outgoingEdges = edges.filter((e) => e.from === currentTaskId);
+            currentTaskId = null;
+            for (const edge of outgoingEdges) {
+                if (!edge.condition || edge.condition(state)) {
+                    currentTaskId = edge.to;
+                    break;
+                }
+            }
+        }
+        return {
+            outputsByTask: Object.fromEntries(state.outputs),
+            ledger: this.options.ledger?.getEntries() || [],
+        };
+    }
+}
+/**
+ * Helper function to create a LangGraph adapter
+ */
+export function asLangGraph(options) {
+    return new LangGraphAdapter(options);
+}
+//# sourceMappingURL=langgraph.js.map

package/dist/langgraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"langgraph.js","sourceRoot":"","sources":["../src/langgraph.ts"],"names":[],"mappings":"AAAA,4BAA4B;AAC5B,OAAO,EACL,wBAAwB,GAWzB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,4BAA4B,EAAE,MAAM,mBAAmB,CAAC;AAqCjE;;;;;GAKG;AACH,MAAM,OAAO,gBAAgB;IACP;IAApB,YAAoB,OAAgC;QAAhC,YAAO,GAAP,OAAO,CAAyB;QAClD,wDAAwD;QACxD,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CACV,+DAA+D;gBAC/D,qEAAqE,CACtE,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,MAAc;QACvC,OAAO,KAAK,EAAE,KAAiB,EAAgC,EAAE;YAC/D,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;YAExF,yBAAyB;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACzD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,oBAAoB,CAAC,CAAC;YACtD,CAAC;YAED,IAAI,CAAC;gBACH,0BAA0B;gBAC1B,MAAM,cAAc,GAAG,QAAQ,CAAC,aAAa,IAAI,QAAQ,CAAC,UAAU,CAAC;gBACrE,IAAI,CAAC,cAAc,EAAE,CAAC;oBACpB,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,+BAA+B,CAAC,CAAC;gBACjE,CAAC;gBAED,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;gBACxD,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,IAAI,KAAK,CAAC,cAAc,cAAc,YAAY,CAAC,CAAC;gBAC5D,CAAC;gBAED,oBAAoB;gBACpB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC;gBACpF,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;oBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC9B,CAAC;gBAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC;oBAC1C,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBAC5B,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM;oBACpC,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,MAAM;oBACN,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,OAAO,EAAE,KAAK,CAAC,OAAO;oBACtB,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO;oBAC3C,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK;oBACvC,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;iBACvC,CAAC,CAAC;gBAEH,MAAM,aAAa,GAAG,IAAI,wBAAwB,CAAC,KAAK,CAAC,EAAE;oBACzD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;gBACzD,CAAC,CAAC,CAAC;gBACH,OAAO,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;gBAE1C,MAAM,OAAO,GAAG,4BAA4B,CAAC;oBAC3C,MAAM;oBACN,UAAU,EAAE,cAAc;oBAC1B,YAAY;oBACZ,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;iBAC5B,CAAC,CAAC;gBAEH,MAAM,UAAU,GAAe;oBAC7B,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;oBACvB,OAAO,EAAE,KAAK,CAAC,OAAO;oBACtB,OAAO,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;oBAC1C,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;oBACtC,OAAO;oBACP,qBAAqB,EAAE,GAAG,EAAE,CAAC,kBAAkB;oBAC/C,MAAM;oBACN,OAAO;oBACP,eAAe,EAAE,aAAa;iBAC/B,CAAC;gBAEF,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,SAAS,EAAE,CAAC;gBAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,eAAe,EAAE,CAAC;oBACzC,MAAM,IAAI,KAAK,CACb,QAAQ,MAAM,2CAA2C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACpG,CAAC;gBACJ,CAAC;gBAED,mBAAmB;gBACnB,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;oBAExF,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE;wBACjD,MAAM,EAAE,QAAQ,CAAC,UAAU;wBAC3B,KAAK,EAAE,WAAW;wBAClB,OAAO,EAAE,KAAK,CAAC,OAAO;qBACvB,CAAC,CAAC;oBAEH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;wBACpB,MAAM,IAAI,KAAK,CAAC,8BAA8B,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;oBACvE,CAAC;gBACH,CAAC;gBAED,eAAe;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;gBAE1D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;gBAEvE,qBAAqB;gBACrB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC1C,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAE/B,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;gBAE9D,gBAAgB;gBAChB,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;gBACzE,CAAC;gBAED,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;gBAClD,IAAI,SAAS,CAAC,MAAM,KAAK,oBAAoB,IAAI,SAAS,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;oBACjF,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,sBAAsB,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;gBAC1E,CAAC;gBAED,OAAO;oBACL,MAAM;oBACN,MAAM;oBACN,OAAO,EAAE,UAAU;iBACpB,CAAC;YACJ,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBAE1D,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC3D,CAAC;gBAED,OAAO;oBACL,MAAM;oBACN,KAAK,EAAE,KAAc;iBACtB,CAAC;YACJ,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,KAAc;QACzC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC;QACpB,CAAC;QAED,OAAO,CAAC,KAAiB,EAAW,EAAE;YACpC,IAAI,CAAC;gBACH,0BAA0B;gBAC1B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,KAAK,EAAE,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACxD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,UAAU;QAKR,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+D,CAAC;QACrF,MAAM,KAAK,GAAoF,EAAE,CAAC;QAElG,6BAA6B;QAC7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,eAAe;QACf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;aAC1E,CAAC,CAAC;QACL,CAAC;QAED,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAE3F,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IACtC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO;QACX,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAEvD,mBAAmB;QACnB,MAAM,KAAK,GAAe;YACxB,MAAM,EAAE,UAAU;YAClB,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO;YAC7B,OAAO,EAAE,IAAI,GAAG,EAAE;SACnB,CAAC;QAEF,6CAA6C;QAC7C,wEAAwE;QACxE,IAAI,aAAa,GAAkB,UAAU,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,OAAO,aAAa,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;YACpD,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAE3B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC1C,IAAI,CAAC,QAAQ;gBAAE,MAAM;YAErB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAE7B,iBAAiB;YACjB,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC;YACpE,aAAa,GAAG,IAAI,CAAC;YAErB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC7C,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC;oBACxB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;YAChD,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE;SAChD,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAgC;IAC1D,OAAO,IAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC;AACvC,CAAC"}

package/dist/msaf.d.ts

@@ -0,0 +1,76 @@
+import { type Goal, type Context, type Plan, type CapabilityRegistry, type ToolRegistry, type PolicyEngine, type StreamSink, type NucleusFactory, type NucleusConfig } from '@ddse/acm-sdk';
+import type { MemoryLedger } from '@ddse/acm-runtime';
+/**
+ * MS Agent Framework adapter options
+ */
+export interface MSAgentFrameworkAdapterOptions {
+    goal: Goal;
+    context: Context;
+    plan: Plan;
+    capabilityRegistry: CapabilityRegistry;
+    toolRegistry: ToolRegistry;
+    policy?: PolicyEngine;
+    stream?: StreamSink;
+    ledger?: MemoryLedger;
+    resumeFrom?: string;
+    checkpointStore?: any;
+    nucleusFactory: NucleusFactory;
+    nucleusConfig: {
+        llmCall: NucleusConfig['llmCall'];
+        hooks?: NucleusConfig['hooks'];
+        allowedTools?: string[];
+    };
+}
+/**
+ * Agent activity state
+ */
+export interface ActivityState {
+    taskId: string;
+    input: any;
+    output?: any;
+    context: Context;
+    outputs: Map<string, any>;
+}
+/**
+ * Activity handler type
+ */
+export type ActivityHandler = (state: ActivityState) => Promise<any>;
+/**
+ * Microsoft Agent Framework Adapter for ACM
+ *
+ * Converts ACM tasks into MS Agent Framework activities with proper
+ * hooks for policy, verification, and streaming.
+ */
+export declare class MSAgentFrameworkAdapter {
+    private options;
+    private activities;
+    constructor(options: MSAgentFrameworkAdapterOptions);
+    /**
+     * Build activity handlers from ACM tasks
+     */
+    private buildActivities;
+    /**
+     * Get activity handler for a task
+     */
+    getActivity(taskId: string): ActivityHandler | undefined;
+    /**
+     * Get all activities
+     */
+    getAllActivities(): Map<string, ActivityHandler>;
+    /**
+     * Execute workflow using MS Agent Framework pattern
+     */
+    execute(): Promise<{
+        outputsByTask: Record<string, any>;
+        ledger: readonly any[];
+    }>;
+    /**
+     * Topological sort of tasks based on edges
+     */
+    private topologicalSort;
+}
+/**
+ * Helper function to create MS Agent Framework adapter
+ */
+export declare function wrapAgentNodes(options: MSAgentFrameworkAdapterOptions): MSAgentFrameworkAdapter;
+//# sourceMappingURL=msaf.d.ts.map

package/dist/msaf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"msaf.d.ts","sourceRoot":"","sources":["../src/msaf.ts"],"names":[],"mappings":"AACA,OAAO,EAEL,KAAK,IAAI,EACT,KAAK,OAAO,EACZ,KAAK,IAAI,EACT,KAAK,kBAAkB,EACvB,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,UAAU,EAEf,KAAK,cAAc,EACnB,KAAK,aAAa,EACnB,MAAM,eAAe,CAAC;AAEvB,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,8BAA8B;IAC7C,IAAI,EAAE,IAAI,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,IAAI,CAAC;IACX,kBAAkB,EAAE,kBAAkB,CAAC;IACvC,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,GAAG,CAAC;IACtB,cAAc,EAAE,cAAc,CAAC;IAC/B,aAAa,EAAE;QACb,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC;QAClC,KAAK,CAAC,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;QAC/B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;KACzB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,GAAG,CAAC;IACX,MAAM,CAAC,EAAE,GAAG,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,aAAa,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC;AAErE;;;;;GAKG;AACH,qBAAa,uBAAuB;IAGtB,OAAO,CAAC,OAAO;IAF3B,OAAO,CAAC,UAAU,CAA2C;gBAEzC,OAAO,EAAE,8BAA8B;IAW3D;;OAEG;IACH,OAAO,CAAC,eAAe;IAwLvB;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAIxD;;OAEG;IACH,gBAAgB,IAAI,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC;IAIhD;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC;QAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,EAAE,CAAA;KAAE,CAAC;IA+BxF;;OAEG;IACH,OAAO,CAAC,eAAe;CAwCxB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,8BAA8B,GAAG,uBAAuB,CAE/F"}