Image de couverture de livre

Multi types and reasonable space

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Accattoli, Beniamino, Lago, Ugo Dal, Vanoni, Gabriele
Format:	Preprint
Publié:	2022
Sujets:	Programming Languages Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Reasonable Space for the $λ$-Calculus, Logarithmically
par: Accattoli, Beniamino, et autres
Publié: (2022)

Interaction Equivalence
par: Accattoli, Beniamino, et autres
Publié: (2024)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
par: Accattoli, Beniamino
Publié: (2022)

The Vanilla Sequent Calculus is Call-by-Value (Fresh Perspective)
par: Accattoli, Beniamino
Publié: (2024)

Positive Focusing is Directly Useful
par: Accattoli, Beniamino, et autres
Publié: (2024)

Positive Sharing and Abstract Machines
par: Accattoli, Beniamino, et autres
Publié: (2025)

Linearization via Rewriting (Long Version)
par: Lago, Ugo Dal, et autres
Publié: (2025)

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
par: Colledan, Andrea, et autres
Publié: (2024)

Monadic Intersection Types, Relationally (Extended Version)
par: Gavazzo, Francesco, et autres
Publié: (2024)

Interaction Improvement
par: Lancelot, Adrienne, et autres
Publié: (2026)

Mirroring Call-by-Need, or Values Acting Silly
par: Accattoli, Beniamino, et autres
Publié: (2024)

IMELL Cut Elimination with Linear Overhead
par: Accattoli, Beniamino, et autres
Publié: (2024)

TensorRocq: Enabling diagrammatic reasoning in Rocq
par: Caldwell, Benjamin, et autres
Publié: (2026)

Complete first-order reasoning for functional programs
par: Murali, Adithya, et autres
Publié: (2026)

Slightly Non-Linear Higher-Order Tree Transducers
par: Nguyên, Lê Thành Dũng, et autres
Publié: (2024)

On Randomized Computational Models and Complexity Classes: a Historical Overview
par: Antonelli, Melissa, et autres
Publié: (2024)

On The Metric Nature of (Differential) Logical Relations
par: Lago, Ugo Dal, et autres
Publié: (2025)

On the Metric Nature of (Differential) Logical Relations
par: Lago, Ugo Dal, et autres
Publié: (2026)

The Cost of Skeletal Call-by-Need, Smoothly
par: Accattoli, Beniamino, et autres
Publié: (2025)

A formalization of System I with type Top in Agda
par: Séttimo, Agustín, et autres
Publié: (2026)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
par: Ye, Kangfeng, et autres
Publié: (2023)

Simply typed convertibility is TOWER-complete even for safe lambda-terms
par: Nguyên, Lê Thành Dũng
Publié: (2023)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
par: Chardonnet, Kostia, et autres
Publié: (2026)

Multi-paradigm Logic Programming in the ${\cal E}$rgoAI System
par: Kifer, Michael, et autres
Publié: (2026)

Frex: dependently-typed algebraic simplification
par: Allais, Guillaume, et autres
Publié: (2023)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
par: Baillot, Patrick, et autres
Publié: (2024)

Kleene algebra with commutativity conditions is undecidable
par: de Amorim, Arthur Azevedo, et autres
Publié: (2024)

s2n-bignum-bench: A practical benchmark for evaluating low-level code reasoning of LLMs
par: Rao, Balaji, et autres
Publié: (2026)

Intersection Types for a Computational Lambda-Calculus with Global State
par: de'Liguoro, Ugo, et autres
Publié: (2021)

Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics
par: Kaye, George
Publié: (2025)

Impredicativity in Linear Dependent Type Theory
par: Speight, Sam, et autres
Publié: (2026)

Unrealizability Logic
par: Kim, Jinwoo, et autres
Publié: (2022)

Towards Concurrent Quantitative Separation Logic
par: Fesefeldt, Ira, et autres
Publié: (2022)

A programming language characterizing quantum polynomial time
par: Hainry, Emmanuel, et autres
Publié: (2022)

On Higher-Order Reachability Games vs May Reachability
par: Asada, Kazuyuki, et autres
Publié: (2022)

revTPL: The Reversible Temporal Process Language
par: Bocchi, Laura, et autres
Publié: (2022)

Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
par: Cristiá, Maximiliano, et autres
Publié: (2022)

A Probabilistic Choreography Language for PRISM
par: Carbone, Marco, et autres
Publié: (2025)

Internalizing Representation Independence with Univalence
par: Angiuli, Carlo, et autres
Publié: (2020)

Denotational Semantics for Probabilistic and Concurrent Programs
par: Zilberstein, Noam, et autres
Publié: (2025)