Cover Image

On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kobayashi, Naoki
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)

One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus
by: Cerna, David M., et al.
Published: (2022)

Intersection Types for a Computational Lambda-Calculus with Global State
by: de'Liguoro, Ugo, et al.
Published: (2021)

On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System
by: Matsuoka, Satoshi
Published: (2026)

Bidirectional Interpolation for the Lambda-Calculus -- Revisiting and Formalising Craig-Čubrić Interpolation
by: Bertrand, Meven Lennon, et al.
Published: (2026)

Lax Modal Lambda Calculi
by: Valliappan, Nachiappan
Published: (2025)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)

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

Uniform Algebras: Models and constructive Completeness for Full, Simply Typed λProlog
by: Amato, Gianluca, et al.
Published: (2024)

Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
by: Endo, Ryunosuke, et al.
Published: (2025)

The Functional Machine Calculus III: Control
by: Heijltjes, Willem
Published: (2025)

Functional Array Programming in an Extended Pi-Calculus
by: Hüttel, Hans, et al.
Published: (2024)

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

Reasonable Space for the $λ$-Calculus, Logarithmically
by: Accattoli, Beniamino, et al.
Published: (2022)

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
by: Genco, Francesco A., et al.
Published: (2023)

Extensional and Non-extensional Functions as Processes
by: Sakayori, Ken, et al.
Published: (2024)

Expressive Power of One-Shot Control Operators and Coroutines
by: Kobayashi, Kentaro, et al.
Published: (2025)

Expressivity of AuDaLa: Turing Completeness and Possible Extensions
by: Franken, Tom T. P., et al.
Published: (2024)

Groups and Inverse Semigroups in Lambda Calculus
by: Bucciarelli, Antonio, et al.
Published: (2026)

Type Theory With Erasure
by: Theocharis, Constantine, et al.
Published: (2026)

Orthologic Type Systems
by: Guilloud, Simon, et al.
Published: (2025)

Guard Analysis and Safe Erasure Gradual Typing: a Type System for Elixir
by: Castagna, Giuseppe, et al.
Published: (2024)

On the Expressivity of Typed Concurrent Calculi
by: Paulus, Joseph William Neal
Published: (2024)

Logic Programming with Extensible Types
by: Perez, Ivan, et al.
Published: (2026)

Type-Based Termination for Futures
by: Somayyajula, Siva, et al.
Published: (2021)

Layered Modal Type Theories
by: Hu, Jason Z. S., et al.
Published: (2023)

Dependent Type Refinements for Futures
by: Somayyajula, Siva, et al.
Published: (2023)

Impredicativity in Linear Dependent Type Theory
by: Speight, Sam, et al.
Published: (2026)

Linear Contextual Metaprogramming and Session Types
by: Ângelo, Pedro, et al.
Published: (2024)

Types, equations, dimensions and the Pi theorem
by: Botta, Nicola, et al.
Published: (2023)

Typed compositional quantum computation with lenses
by: Garrigue, Jacques, et al.
Published: (2023)

A Rewriting Theory for Quantum Lambda-Calculus
by: Faggian, Claudia, et al.
Published: (2024)

Hybrid Intersection Types for PCF (Extended Version)
by: Barenbaum, Pablo, et al.
Published: (2024)

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

Dependent Multiplicities in Dependent Linear Type Theory
by: Doré, Maximilian
Published: (2025)

Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)

Typed Non-determinism in Concurrent Calculi: The Eager Way
by: Heuvel, Bas van den, et al.
Published: (2024)

Crash-Stop Failures in Asynchronous Multiparty Session Types
by: Barwell, Adam D., et al.
Published: (2023)

Deciding Serializability in Network Systems
by: Amir, Guy, et al.
Published: (2026)

A Graded Modal Dependent Type Theory with Erasure, Formalized
by: Abel, Andreas, et al.
Published: (2026)