:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Abadi, Martin, Plotkin, Gordon
Formato:	Preprint
Publicado:	2020
Materias:	Logic in Computer Science Machine Learning Programming Languages
Acceso en línea:	https://arxiv.org/abs/2007.08926
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Handling the Selection Monad (Full Version)
por: Plotkin, Gordon, et al.
Publicado: (2025)

Monadic Intersection Types, Relationally (Extended Version)
por: Gavazzo, Francesco, et al.
Publicado: (2024)

Stone Duality for Monads
por: Garner, Richard, et al.
Publicado: (2026)

MiniF2F in Rocq: Automatic Translation Between Proof Assistants -- A Case Study
por: Viennot, Jules, et al.
Publicado: (2025)

Loop Invariant Generation: A Hybrid Framework of Reasoning optimised LLMs and SMT Solvers
por: Bharti, Varun, et al.
Publicado: (2025)

Boosting Few-Pixel Robustness Verification via Covering Verification Designs
por: Shapira, Yuval, et al.
Publicado: (2024)

Mini-Batch Robustness Verification of Deep Neural Networks
por: Tzour-Shaday, Saar, et al.
Publicado: (2025)

Towards a Certified Proof Checker for Deep Neural Network Verification
por: Desmartin, Remi, et al.
Publicado: (2023)

Programmatic Reinforcement Learning: Navigating Gridworlds
por: Shabadi, Guruprerana, et al.
Publicado: (2024)

Floating-Point Neural Networks Are Provably Robust Universal Approximators
por: Hwang, Geonho, et al.
Publicado: (2025)

Neural Network Verification is a Programming Language Challenge
por: Cordeiro, Lucas C., et al.
Publicado: (2025)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
por: Ye, Kangfeng, et al.
Publicado: (2023)

Strong Dinatural Transformations and Generalised Codensity Monads
por: Piróg, Maciej, et al.
Publicado: (2025)

Finite-Choice Logic Programming
por: Martens, Chris, et al.
Publicado: (2024)

PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
por: Tsoukalas, George, et al.
Publicado: (2024)

From Symbolic Tasks to Code Generation: Diversification Yields Better Task Performers
por: Zhang, Dylan, et al.
Publicado: (2024)

NLP Verification: Towards a General Methodology for Certifying Robustness
por: Casadio, Marco, et al.
Publicado: (2024)

Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning
por: Mukherji, Kaustuv, et al.
Publicado: (2025)

ScenicProver: A Framework for Compositional Probabilistic Verification of Learning-Enabled Systems
por: Vin, Eric, et al.
Publicado: (2025)

ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving
por: Thakur, Amitayush, et al.
Publicado: (2025)

An In-Context Learning Agent for Formal Theorem-Proving
por: Thakur, Amitayush, et al.
Publicado: (2023)

Decidable By Construction: Design-Time Verification for Trustworthy AI
por: Haynes, Houston
Publicado: (2026)

Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs
por: Li, Guchan, et al.
Publicado: (2026)

Verification Modulo Tested Library Contracts
por: Uppar, Abhishek, et al.
Publicado: (2026)

Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
por: Dvir, Yotam, et al.
Publicado: (2025)

Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning
por: Luo, Ziyan, et al.
Publicado: (2023)

VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search
por: Brandfonbrener, David, et al.
Publicado: (2024)

Towards Regulated Deep Learning
por: García-Camino, Andrés
Publicado: (2019)

VERINA: Benchmarking Verifiable Code Generation
por: Ye, Zhe, et al.
Publicado: (2025)

CLEVER: A Curated Benchmark for Formally Verified Code Generation
por: Thakur, Amitayush, et al.
Publicado: (2025)

Intent-aligned Formal Specification Synthesis via Traceable Refinement
por: Ye, Zhe, et al.
Publicado: (2026)

Gradual Verification for Smart Contracts
por: Sun, Haojia, et al.
Publicado: (2023)

Combining Textual and Structural Information for Premise Selection in Lean
por: Petrovčič, Job, et al.
Publicado: (2025)

Critical Sections Are Not Per-Thread: A Trace Semantics for Lock-Based Concurrency
por: Sulzmann, Martin
Publicado: (2026)

Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
por: Guzmán, Manuel Vargas, et al.
Publicado: (2025)

Process discovery on deviant traces and other stranger things
por: Chesani, Federico, et al.
Publicado: (2021)

Process-Driven Autoformalization in Lean 4
por: Lu, Jianqiao, et al.
Publicado: (2024)

Interchangeable Token Embeddings for Extendable Vocabulary and Alpha-Equivalence
por: Işık, İlker, et al.
Publicado: (2024)

MANTRA: Synthesizing SMT-Validated Compliance Benchmarks for Tool-Using LLM Agents
por: Anand, Ashwani, et al.
Publicado: (2026)

Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP
por: Baudart, Guillaume, et al.
Publicado: (2026)