harn_builtin_meta/

lib.rs

//! Const-constructible type definitions for Harn builtin signatures.
//!
//! Both `harn-parser` (for typechecking) and `harn-vm` (for runtime metadata)
//! consume these shapes. Living in a dep-free crate lets the parser see the
//! types without depending on the VM, and lets the `#[harn_builtin]` proc-macro
//! emit `const` literals that link into either side.
//!
//! `Ty::to_type_expr` and friends, which convert into the parser's runtime
//! `TypeExpr`, live in `harn-parser` since they depend on parser-internal AST.
//!
//! The [`shapes`] submodule holds the named structural-record consts
//! (`LLM_CALL_OPTIONS`, `LLM_CALL_RESULT`, `TRANSCRIPT`, …) shared by the
//! parser's static typechecking tables and the `#[harn_builtin]` macro's
//! `@NAME` signature injection.

/// Crate-local source contribution to compiler and check cache identities.
pub const SOURCE_FINGERPRINT: &str = env!("HARN_SOURCE_FINGERPRINT");

pub mod contracts;
mod harness_kind;
pub mod host_capabilities;
pub mod llm_options;
pub mod methods;
pub mod predicate;
pub mod runtime_type_tags;
pub mod shapes;
pub mod signatures;

pub use contracts::{
    wire_identifier_key, BuiltinContract, BuiltinExposure, CapabilityId, EffectAccess,
    EffectAuthorization, EffectKind, EffectSpec, ResourceSelector,
};
pub use harness_kind::HarnessKind;
pub use methods::{MethodDescriptor, MethodEffect, MethodMigration, MethodReceiver, RemovedMethod};

/// A complete, static description of one builtin: identifier, arity range,
/// per-parameter types, generic type parameters, return type, and any
/// where-clause bounds the type checker should enforce on call.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct BuiltinSignature {
    /// Builtin name as registered in the VM and referenced from Harn source.
    pub name: &'static str,
    /// Positional parameters in declaration order. Trailing entries with
    /// `optional: true` define the lower bound of the arity range; the
    /// remaining entries plus `has_rest` define the upper bound.
    pub params: &'static [Param],
    /// Statically-known return type. Use [`Ty::Any`] when the return is
    /// genuinely dynamic (e.g. `json_parse`).
    pub returns: Ty,
    /// Generic type parameter names declared on this builtin (e.g. `["T"]`
    /// for `schema_parse<T>`).
    pub type_params: &'static [&'static str],
    /// True when the final parameter is variadic (rest). When set, the
    /// effective arity upper bound is unbounded and the runtime will treat
    /// trailing args as the rest-list.
    pub has_rest: bool,
    /// `where T: Foo` constraints. Each entry binds a generic type
    /// parameter name to the name of an interface it must implement.
    pub where_clauses: &'static [(&'static str, &'static str)],
    /// Call-site record projection, when the result depends on selected keys.
    /// `returns` remains the conservative contract for an indirect call.
    pub projection: Option<RecordProjection>,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum RecordProjection {
    Pick { source: usize, keys: usize },
}

impl BuiltinSignature {
    /// Reuse a canonical signature shape under a projected source name.
    pub const fn with_name(self, name: &'static str) -> Self {
        Self { name, ..self }
    }

    pub const fn with_projection(self, projection: RecordProjection) -> Self {
        Self {
            projection: Some(projection),
            ..self
        }
    }
}

/// One parameter slot inside a [`BuiltinSignature`].
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct Param {
    pub name: &'static str,
    pub ty: Ty,
    /// True when this parameter has a default at the call site (so it may
    /// be omitted). All optional params must be trailing.
    pub optional: bool,
}

impl Param {
    pub const fn new(name: &'static str, ty: Ty) -> Self {
        Self {
            name,
            ty,
            optional: false,
        }
    }

    pub const fn optional(name: &'static str, ty: Ty) -> Self {
        Self {
            name,
            ty,
            optional: true,
        }
    }
}

/// `const`-friendly type IR used in builtin descriptors. Mirrors the runtime
/// `TypeExpr` from `harn-parser` but is constructable in `const` position with
/// no allocation. Convert to `TypeExpr` at the boundary via the parser-side
/// `Ty::to_type_expr` helper.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum Ty {
    /// A primitive or user-defined named type: `int`, `string`, `bool`,
    /// `float`, `nil`, `bytes`, `dict`, `list`, `closure`, `duration`,
    /// `any`, etc.
    Named(&'static str),
    /// Reference to a generic type parameter declared on the enclosing
    /// signature (e.g. `Generic("T")`).
    Generic(&'static str),
    /// Untyped/dynamic. Skips type validation at runtime; the static
    /// checker treats it as compatible with everything.
    Any,
    /// Optional sugar for `T | nil`.
    Optional(&'static Ty),
    /// Generic application: `List<T>` is `Apply("list", &[T])`,
    /// `Result<T, E>` is `Apply("Result", &[T, E])`, `Schema<T>` is
    /// [`Ty::SchemaOf`].
    Apply(&'static str, &'static [Ty]),
    /// Union of N alternatives. Empty unions are rejected by the
    /// parser-side converter.
    Union(&'static [Ty]),
    /// Function type. Stores params and return as references so the literal
    /// stays `Copy`.
    Fn(&'static [Ty], &'static Ty),
    /// Record/shape type with named fields. Closed: an argument carrying a
    /// field that is not listed here is rejected.
    Shape(&'static [ShapeFieldDescriptor]),
    /// Open record: named fields plus one or more row tails, mirroring the
    /// language's `{name: string, ...dict}`.
    ///
    /// Use this for a builtin that takes an extensible options/config dict.
    /// A closed [`Ty::Shape`] would reject every key the signature does not
    /// name, so such a parameter would otherwise have to fall back to a bare
    /// `dict` and lose all field checking — including the declared type of a
    /// `handler` slot.
    OpenShape(&'static [ShapeFieldDescriptor], &'static [Ty]),
    /// `Schema<T>` marker — semantically `Apply("Schema", &[Generic(T)])`
    /// but distinguished so the type checker can pull the bound `T` from
    /// the *value* of the schema arg (not its declared type).
    SchemaOf(&'static str),
    /// Bottom type (no return).
    Never,
    /// Integer literal type: `0`, `1`. Assignable to `int`.
    LitInt(i64),
    /// String literal type: `"pass"`. Assignable to `string`.
    LitString(&'static str),
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct ShapeFieldDescriptor {
    pub name: &'static str,
    pub ty: Ty,
    pub optional: bool,
}

impl ShapeFieldDescriptor {
    pub const fn new(name: &'static str, ty: Ty) -> Self {
        Self {
            name,
            ty,
            optional: false,
        }
    }

    pub const fn optional(name: &'static str, ty: Ty) -> Self {
        Self {
            name,
            ty,
            optional: true,
        }
    }
}

impl Ty {
    /// True when this type carries no constraints (validation is a no-op).
    pub const fn is_any(&self) -> bool {
        matches!(self, Ty::Any)
    }
}

/// Render shape fields and row tails in the `#[harn_builtin]` sig grammar.
///
/// An optional field is written `name?: ty`, not `name: ty?`. The trailing
/// form does not round-trip: the sig parser folds a trailing `?` into the
/// type as `ty | nil` and leaves the field required.
fn write_shape_members(
    f: &mut core::fmt::Formatter<'_>,
    fields: &[ShapeFieldDescriptor],
    rests: &[Ty],
) -> core::fmt::Result {
    for (i, fld) in fields.iter().enumerate() {
        if i > 0 {
            f.write_str(", ")?;
        }
        let name = fld.name;
        let ty = &fld.ty;
        let optional = if fld.optional { "?" } else { "" };
        write!(f, "{name}{optional}: {ty}")?;
    }
    for (i, rest) in rests.iter().enumerate() {
        if i > 0 || !fields.is_empty() {
            f.write_str(", ")?;
        }
        write!(f, "...{rest}")?;
    }
    Ok(())
}

impl core::fmt::Display for Ty {
    /// Render a parsed [`Ty`] back into the `#[harn_builtin]` sig grammar.
    /// Round-trip target: parsing the output through the proc-macro's
    /// sig parser yields a structurally-equal [`Ty`] (modulo whitespace and
    /// canonical operator spacing). See the drift test in
    /// `crates/harn-vm/tests/harn_vm/builtin_signature_text_drift.rs`.
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        match self {
            Ty::Named(s) | Ty::Generic(s) => f.write_str(s),
            Ty::Any => f.write_str("any"),
            Ty::Never => f.write_str("never"),
            Ty::Optional(inner) => write!(f, "{inner}?"),
            Ty::Apply(name, args) => {
                f.write_str(name)?;
                f.write_str("<")?;
                for (i, a) in args.iter().enumerate() {
                    if i > 0 {
                        f.write_str(", ")?;
                    }
                    write!(f, "{a}")?;
                }
                f.write_str(">")
            }
            Ty::Union(parts) => {
                // Recover sig-grammar sugar so output round-trips through
                // the proc-macro sig parser (which desugars `T?` and
                // `number` into unions).
                if let [inner, Ty::Named("nil")] = parts {
                    if !matches!(inner, Ty::Named("nil")) {
                        return write!(f, "{inner}?");
                    }
                }
                if let [Ty::Named("int"), Ty::Named("float")] = parts {
                    return f.write_str("number");
                }
                for (i, p) in parts.iter().enumerate() {
                    if i > 0 {
                        f.write_str(" | ")?;
                    }
                    write!(f, "{p}")?;
                }
                Ok(())
            }
            Ty::Fn(params, ret) => {
                f.write_str("(")?;
                for (i, p) in params.iter().enumerate() {
                    if i > 0 {
                        f.write_str(", ")?;
                    }
                    write!(f, "{p}")?;
                }
                write!(f, ") -> {ret}")
            }
            Ty::Shape(fields) => {
                f.write_str("{")?;
                write_shape_members(f, fields, &[])?;
                f.write_str("}")
            }
            Ty::OpenShape(fields, rests) => {
                f.write_str("{")?;
                write_shape_members(f, fields, rests)?;
                f.write_str("}")
            }
            Ty::SchemaOf(t) => write!(f, "Schema<{t}>"),
            Ty::LitInt(n) => write!(f, "{n}"),
            Ty::LitString(s) => write!(f, "\"{s}\""),
        }
    }
}

impl BuiltinSignature {
    /// Non-generic, fixed-arity builtin: no type parameters, no rest, no
    /// where-clause bounds. Covers ~70% of the registry; lets each call
    /// site stay on a single logical line.
    pub const fn simple(name: &'static str, params: &'static [Param], returns: Ty) -> Self {
        Self {
            name,
            params,
            returns,
            type_params: &[],
            has_rest: false,
            where_clauses: &[],
            projection: None,
        }
    }

    /// Non-generic builtin whose final parameter is variadic (rest).
    /// Equivalent to [`Self::simple`] with `has_rest: true`.
    pub const fn variadic(name: &'static str, params: &'static [Param], returns: Ty) -> Self {
        Self {
            name,
            params,
            returns,
            type_params: &[],
            has_rest: true,
            where_clauses: &[],
            projection: None,
        }
    }

    /// Generic, fixed-arity builtin: declares type parameters, no rest,
    /// no where-clause bounds. Use the struct literal directly when both
    /// generics and where-clauses or rest are needed.
    pub const fn generic(
        name: &'static str,
        type_params: &'static [&'static str],
        params: &'static [Param],
        returns: Ty,
    ) -> Self {
        Self {
            name,
            params,
            returns,
            type_params,
            has_rest: false,
            where_clauses: &[],
            projection: None,
        }
    }

    /// Number of required parameters (those without defaults).
    pub fn required_params(&self) -> usize {
        self.params.iter().filter(|p| !p.optional).count()
    }

    /// True when this builtin recognises `name` as one of its declared
    /// generic type parameters.
    pub fn is_type_param(&self, name: &str) -> bool {
        self.type_params.contains(&name)
    }

    /// True when this builtin declares any generic type parameters.
    pub fn is_generic(&self) -> bool {
        !self.type_params.is_empty()
    }

    /// Materialize the type parameter names as owned strings (for use in
    /// the type checker's existing scope/binding APIs which key off
    /// `Vec<String>`).
    pub fn type_param_names(&self) -> Vec<String> {
        self.type_params.iter().map(|s| (*s).to_string()).collect()
    }

    /// Where-clause constraints as `(type_param, interface)` strings.
    pub fn where_clause_strings(&self) -> Vec<(String, String)> {
        self.where_clauses
            .iter()
            .map(|(tp, iface)| ((*tp).to_string(), (*iface).to_string()))
            .collect()
    }
}

impl core::fmt::Display for BuiltinSignature {
    /// Render a parsed [`BuiltinSignature`] back into the `#[harn_builtin]`
    /// `sig = "..."` grammar. Used by the drift test and by tooling that
    /// wants a canonical string form of the signature regardless of how it
    /// was originally typed.
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        if !self.type_params.is_empty() {
            f.write_str("<")?;
            for (i, tp) in self.type_params.iter().enumerate() {
                if i > 0 {
                    f.write_str(", ")?;
                }
                f.write_str(tp)?;
            }
            if !self.where_clauses.is_empty() {
                f.write_str(" where ")?;
                for (i, (tp, iface)) in self.where_clauses.iter().enumerate() {
                    if i > 0 {
                        f.write_str(", ")?;
                    }
                    write!(f, "{tp}: {iface}")?;
                }
            }
            f.write_str("> ")?;
        }
        f.write_str(self.name)?;
        f.write_str("(")?;
        let last_idx = self.params.len().saturating_sub(1);
        for (i, p) in self.params.iter().enumerate() {
            if i > 0 {
                f.write_str(", ")?;
            }
            if self.has_rest && i == last_idx {
                f.write_str("...")?;
            }
            f.write_str(p.name)?;
            if p.optional {
                f.write_str("?")?;
            }
            let ty = &p.ty;
            write!(f, ": {ty}")?;
        }
        let ret = &self.returns;
        write!(f, ") -> {ret}")
    }
}

/// Public view of one builtin used by `harn-lint` and other crates that need
/// just identifier + return-type hints (no parameter types).
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct BuiltinMetadata {
    pub name: &'static str,
    pub return_types: &'static [&'static str],
}

// ---- Convenience constants ----
//
// Used pervasively in builtin signature literals to keep individual entries
// terse. Add new constants here when a type appears repeatedly enough to
// warrant a shorthand (avoid one-off shorthands).

pub const TY_ANY: Ty = Ty::Any;
pub const TY_BOOL: Ty = Ty::Named("bool");
pub const TY_BYTES: Ty = Ty::Named("bytes");
pub const TY_CLOSURE: Ty = Ty::Named("closure");
pub const TY_DECIMAL: Ty = Ty::Named("decimal");
pub const TY_DICT: Ty = Ty::Named("dict");
pub const TY_DURATION: Ty = Ty::Named("duration");
pub const TY_FLOAT: Ty = Ty::Named("float");
pub const TY_INT: Ty = Ty::Named("int");
pub const TY_LIST: Ty = Ty::Named("list");
pub const TY_NEVER: Ty = Ty::Never;
pub const TY_NIL: Ty = Ty::Named("nil");
pub const TY_RESOURCE: Ty = Ty::Named("resource");
pub const TY_STRING: Ty = Ty::Named("string");

/// `string | nil`.
pub const TY_STRING_OR_NIL: Ty = Ty::Union(&[TY_STRING, TY_NIL]);
/// `int | nil`.
pub const TY_INT_OR_NIL: Ty = Ty::Union(&[TY_INT, TY_NIL]);
/// `dict | nil`.
pub const TY_DICT_OR_NIL: Ty = Ty::Union(&[TY_DICT, TY_NIL]);
/// `bytes | nil`.
pub const TY_BYTES_OR_NIL: Ty = Ty::Union(&[TY_BYTES, TY_NIL]);
/// `int | float`.
pub const TY_NUMBER: Ty = Ty::Union(&[TY_INT, TY_FLOAT]);

#[cfg(test)]
mod tests {
    use super::*;

    const APPLY_ARGS: &[Ty] = &[TY_DICT];
    const FN_PARAMS: &[Ty] = &[TY_INT, TY_STRING];
    const SHAPE_FIELDS: &[ShapeFieldDescriptor] = &[
        ShapeFieldDescriptor::new("name", TY_STRING),
        ShapeFieldDescriptor::optional("age", TY_INT),
    ];

    const OPEN_SHAPE_RESTS: &[Ty] = &[TY_DICT];

    #[test]
    fn wire_identifier_keys_stay_unique_across_capabilities() {
        // `from_host_namespace` resolves by normalized spelling, so two
        // capabilities whose field names differ only by `_` or case would make
        // every host-wire lookup ambiguous. Guard the vocabulary, not the
        // lookup: the ambiguity would be introduced by adding a capability.
        let mut seen = std::collections::HashMap::new();
        for capability in CapabilityId::ALL {
            let key = wire_identifier_key(capability.field_name());
            if let Some(other) = seen.insert(key.clone(), capability.field_name()) {
                panic!(
                    "`{other}` and `{}` both normalize to `{key}`",
                    capability.field_name()
                );
            }
        }
    }

    #[test]
    fn host_namespace_resolves_the_separatorless_spelling() {
        assert_eq!(
            CapabilityId::from_host_namespace("prmonitor"),
            Some(CapabilityId::PrMonitor)
        );
        assert_eq!(
            CapabilityId::from_host_namespace("PrMonitor"),
            Some(CapabilityId::PrMonitor)
        );
        assert_eq!(
            CapabilityId::from_host_namespace("pr_monitor"),
            Some(CapabilityId::PrMonitor)
        );
        assert_eq!(CapabilityId::from_host_namespace("not_a_capability"), None);
        // The exact parser stays exact: it reads the closed source vocabulary,
        // where a spelling either is or is not the declared field name.
        assert_eq!(CapabilityId::from_field_name("prmonitor"), None);
    }

    #[test]
    fn ty_display_atomic_and_compound() {
        assert_eq!(format!("{TY_INT}"), "int");
        assert_eq!(format!("{TY_ANY}"), "any");
        assert_eq!(format!("{TY_NEVER}"), "never");
        // `T | nil` round-trips as `T?` (the sig grammar's optional sugar
        // is desugared into a 2-element union, not `Ty::Optional`).
        assert_eq!(format!("{TY_STRING_OR_NIL}"), "string?");
        let opt_int = Ty::Optional(&TY_INT);
        assert_eq!(format!("{opt_int}"), "int?");
        // `int | float` round-trips as `number` (the predeclared shorthand).
        assert_eq!(format!("{TY_NUMBER}"), "number");
        let list_dict = Ty::Apply("list", APPLY_ARGS);
        assert_eq!(format!("{list_dict}"), "list<dict>");
        let lit_int = Ty::LitInt(42);
        assert_eq!(format!("{lit_int}"), "42");
        let lit_str = Ty::LitString("pass");
        assert_eq!(format!("{lit_str}"), "\"pass\"");
        let schema_t = Ty::SchemaOf("T");
        assert_eq!(format!("{schema_t}"), "Schema<T>");
        let fn_ty = Ty::Fn(FN_PARAMS, &TY_BOOL);
        assert_eq!(format!("{fn_ty}"), "(int, string) -> bool");
        let shape = Ty::Shape(SHAPE_FIELDS);
        // An optional field renders as `age?: int`, not `age: int?`. The
        // trailing form does not round-trip: the sig parser folds a trailing
        // `?` into the type as `int | nil`, which leaves the field *required*
        // and silently changes the contract.
        assert_eq!(format!("{shape}"), "{name: string, age?: int}");
        let open = Ty::OpenShape(SHAPE_FIELDS, OPEN_SHAPE_RESTS);
        assert_eq!(format!("{open}"), "{name: string, age?: int, ...dict}");
        let tail_only = Ty::OpenShape(&[], OPEN_SHAPE_RESTS);
        assert_eq!(format!("{tail_only}"), "{...dict}");
    }

    const BASIC_PARAMS: &[Param] = &[Param::new("a", TY_DICT), Param::new("b", TY_DICT)];
    const REST_PARAMS: &[Param] = &[Param::new("prefix", TY_STRING), Param::new("args", TY_ANY)];
    const OPT_PARAMS: &[Param] = &[
        Param::new("receipt", TY_DICT),
        Param::optional("candidate", TY_ANY),
    ];
    const GENERIC_PARAMS: &[Param] = &[Param::new("schema", Ty::SchemaOf("T"))];

    #[test]
    fn signature_display_basic() {
        let sig = BuiltinSignature::simple("deep_merge", BASIC_PARAMS, TY_DICT);
        assert_eq!(format!("{sig}"), "deep_merge(a: dict, b: dict) -> dict");
    }

    #[test]
    fn signature_display_with_optional_and_rest() {
        let sig = BuiltinSignature {
            name: "io_println",
            params: REST_PARAMS,
            returns: TY_NIL,
            type_params: &[],
            has_rest: true,
            where_clauses: &[],
            projection: None,
        };
        assert_eq!(
            format!("{sig}"),
            "io_println(prefix: string, ...args: any) -> nil"
        );

        let opt_sig =
            BuiltinSignature::simple("lifecycle_replay_resume_input", OPT_PARAMS, TY_DICT);
        assert_eq!(
            format!("{opt_sig}"),
            "lifecycle_replay_resume_input(receipt: dict, candidate?: any) -> dict"
        );
    }

    #[test]
    fn signature_display_with_generics_and_where() {
        let sig = BuiltinSignature {
            name: "schema_parse",
            params: GENERIC_PARAMS,
            returns: Ty::Generic("T"),
            type_params: &["T"],
            has_rest: false,
            where_clauses: &[("T", "Decode")],
            projection: None,
        };
        assert_eq!(
            format!("{sig}"),
            "<T where T: Decode> schema_parse(schema: Schema<T>) -> T"
        );
    }
}