Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
Fuente:
arXiv
Guardado en:
| Autor principal: | Paul, Abhijit |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
por: Li, Elaine, et al.
Publicado: (2026)
por: Li, Elaine, et al.
Publicado: (2026)
An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
por: Stutz, Felix, et al.
Publicado: (2025)
por: Stutz, Felix, et al.
Publicado: (2025)
Refuting Equivalence in Probabilistic Programs with Conditioning
por: Chatterjee, Krishnendu, et al.
Publicado: (2025)
por: Chatterjee, Krishnendu, et al.
Publicado: (2025)
Equivalence and Similarity Refutation for Probabilistic Programs
por: Chatterjee, Krishnendu, et al.
Publicado: (2024)
por: Chatterjee, Krishnendu, et al.
Publicado: (2024)
Weighted Automata for Exact Inference in Discrete Probabilistic Programs
por: Geißler, Dominik, et al.
Publicado: (2025)
por: Geißler, Dominik, et al.
Publicado: (2025)
Type-safe Monitoring of Parameterized Streams
por: Baumeister, Jan, et al.
Publicado: (2026)
por: Baumeister, Jan, et al.
Publicado: (2026)
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
por: Jia, Xiaodong, et al.
Publicado: (2024)
por: Jia, Xiaodong, et al.
Publicado: (2024)
Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
por: Geißler, Dominik, et al.
Publicado: (2025)
por: Geißler, Dominik, et al.
Publicado: (2025)
CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
por: Zhang, Kaiwen, et al.
Publicado: (2026)
por: Zhang, Kaiwen, et al.
Publicado: (2026)
Synthesizing DSLs for Few-Shot Learning
por: Krogmeier, Paul, et al.
Publicado: (2025)
por: Krogmeier, Paul, et al.
Publicado: (2025)
Realisability and Complementability of Multiparty Session Types
por: Di Giusto, Cinzia, et al.
Publicado: (2025)
por: Di Giusto, Cinzia, et al.
Publicado: (2025)
A Usage-Aware Sequent Calculus for Differential Dynamic Logic
por: Dotzel, Myra, et al.
Publicado: (2023)
por: Dotzel, Myra, et al.
Publicado: (2023)
Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
por: Yu, Qixian, et al.
Publicado: (2025)
por: Yu, Qixian, et al.
Publicado: (2025)
A Word Sampler for Well-Typed Functions
por: Considine, Breandan
Publicado: (2025)
por: Considine, Breandan
Publicado: (2025)
Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2014)
por: Kuriyama, Takayuki
Publicado: (2014)
Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
por: Nepeivoda, Antonina, et al.
Publicado: (2025)
por: Nepeivoda, Antonina, et al.
Publicado: (2025)
Decision Procedure for A Theory of String Sequences
por: Hu, Denghang, et al.
Publicado: (2025)
por: Hu, Denghang, et al.
Publicado: (2025)
Syntax Repair as Language Intersection
por: Considine, Breandan
Publicado: (2025)
por: Considine, Breandan
Publicado: (2025)
Formally Verified Linear-Time Invertible Lexing
por: Chassot, Samuel, et al.
Publicado: (2025)
por: Chassot, Samuel, et al.
Publicado: (2025)
Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
por: Vieira, Tim
Publicado: (2026)
por: Vieira, Tim
Publicado: (2026)
Characterizing Implementability of Global Protocols with Infinite States and Data
por: Li, Elaine, et al.
Publicado: (2024)
por: Li, Elaine, et al.
Publicado: (2024)
Saturating automata for game semantics
por: Dixon, Alex, et al.
Publicado: (2023)
por: Dixon, Alex, et al.
Publicado: (2023)
Maximal and minimal dynamic Petri net slicing
por: Llorens, Marisa, et al.
Publicado: (2021)
por: Llorens, Marisa, et al.
Publicado: (2021)
Reactive graphs in action (extended version)
por: Tinoco, David, et al.
Publicado: (2024)
por: Tinoco, David, et al.
Publicado: (2024)
Polyregular equivalence is undecidable in higher-order types
por: Bojańczyk, Mikołaj, et al.
Publicado: (2026)
por: Bojańczyk, Mikołaj, et al.
Publicado: (2026)
Synchronisability in Mailbox Communication
por: Di Giusto, Cinzia, et al.
Publicado: (2024)
por: Di Giusto, Cinzia, et al.
Publicado: (2024)
Verification under TSO with an infinite Data Domain
por: Abdulla, Parosh Aziz, et al.
Publicado: (2024)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2024)
Linear Matching of JavaScript Regular Expressions
por: Barrière, Aurèle, et al.
Publicado: (2023)
por: Barrière, Aurèle, et al.
Publicado: (2023)
From High-Level Types to Low-Level Monitors: Synthesizing Verified Runtime Checkers for MAVLink
por: Amorim, Arthur, et al.
Publicado: (2026)
por: Amorim, Arthur, et al.
Publicado: (2026)
Presenting Interval Pomsets with Interfaces
por: Amrane, Amazigh, et al.
Publicado: (2024)
por: Amrane, Amazigh, et al.
Publicado: (2024)
Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
por: Latif, Saba, et al.
Publicado: (2025)
por: Latif, Saba, et al.
Publicado: (2025)
Complete Multiparty Session Type Projection with Automata
por: Li, Elaine, et al.
Publicado: (2023)
por: Li, Elaine, et al.
Publicado: (2023)
Information-flow Interfaces and Security Lattices
por: Bartocci, Ezio, et al.
Publicado: (2024)
por: Bartocci, Ezio, et al.
Publicado: (2024)
Productive Quantum Programming Needs Better Abstract Machines
por: Núñez-Corrales, Santiago, et al.
Publicado: (2025)
por: Núñez-Corrales, Santiago, et al.
Publicado: (2025)
Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
por: Zhang, Kaiwen, et al.
Publicado: (2022)
por: Zhang, Kaiwen, et al.
Publicado: (2022)
Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
por: Beldiceanu, Nicolas
Publicado: (2025)
por: Beldiceanu, Nicolas
Publicado: (2025)
Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
por: Shoudai, Takayoshi, et al.
Publicado: (2026)
por: Shoudai, Takayoshi, et al.
Publicado: (2026)
Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2026)
por: Kuriyama, Takayuki
Publicado: (2026)
Structural Abstraction and Refinement for Probabilistic Programs
por: Li, Guanyan, et al.
Publicado: (2025)
por: Li, Guanyan, et al.
Publicado: (2025)
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
por: Bhattacharjee, Kamalika, et al.
Publicado: (2016)
por: Bhattacharjee, Kamalika, et al.
Publicado: (2016)
Ejemplares similares
-
Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
por: Li, Elaine, et al.
Publicado: (2026) -
An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
por: Stutz, Felix, et al.
Publicado: (2025) -
Refuting Equivalence in Probabilistic Programs with Conditioning
por: Chatterjee, Krishnendu, et al.
Publicado: (2025) -
Equivalence and Similarity Refutation for Probabilistic Programs
por: Chatterjee, Krishnendu, et al.
Publicado: (2024) -
Weighted Automata for Exact Inference in Discrete Probabilistic Programs
por: Geißler, Dominik, et al.
Publicado: (2025)